Job scheduling considering best-effort and soft real-time applications on non-dedicated clusters

As Network Of Workstations (NOWs) emerge as a viable platform for a wide range of workloads, new scheduling approaches are needed to allocate the collection of resources from competing applications. New workload types introduce high uncertainty into the predictability of the system, hindering the ap...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Hanzich, Mauricio, Hernández Budé, Porfidio, Luque Fadón, Emilio
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2007
Materias:
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/22968
Aporte de:
id I19-R120-10915-22968
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Informática
job scheduling
non-dedicated clusters
Parallel programming
Scheduling
Clustering
planificación de tareas
clusters no dedicados
spellingShingle Ciencias Informáticas
Informática
job scheduling
non-dedicated clusters
Parallel programming
Scheduling
Clustering
planificación de tareas
clusters no dedicados
Hanzich, Mauricio
Hernández Budé, Porfidio
Luque Fadón, Emilio
Job scheduling considering best-effort and soft real-time applications on non-dedicated clusters
topic_facet Ciencias Informáticas
Informática
job scheduling
non-dedicated clusters
Parallel programming
Scheduling
Clustering
planificación de tareas
clusters no dedicados
description As Network Of Workstations (NOWs) emerge as a viable platform for a wide range of workloads, new scheduling approaches are needed to allocate the collection of resources from competing applications. New workload types introduce high uncertainty into the predictability of the system, hindering the applicability of the job scheduling strategies. A new kind of parallel applications has appeared in business or scientific domains, namely Soft Real-Time (SRT). They, together with new SRT desktop applications, turn prediction into a more difficult goal by adding inherent complexity to estimation procedures. In previous work, we introduced an estimation engine into our job scheduling system, termed CISNE. In this work, the estimation engine is extended, by adding two new kernels, both SRT aware. Experimental results confirm the better performance of simulated respect to the analytical kernels and show a maximum average prediction error deviation of 20%.
format Objeto de conferencia
Objeto de conferencia
author Hanzich, Mauricio
Hernández Budé, Porfidio
Luque Fadón, Emilio
author_facet Hanzich, Mauricio
Hernández Budé, Porfidio
Luque Fadón, Emilio
author_sort Hanzich, Mauricio
title Job scheduling considering best-effort and soft real-time applications on non-dedicated clusters
title_short Job scheduling considering best-effort and soft real-time applications on non-dedicated clusters
title_full Job scheduling considering best-effort and soft real-time applications on non-dedicated clusters
title_fullStr Job scheduling considering best-effort and soft real-time applications on non-dedicated clusters
title_full_unstemmed Job scheduling considering best-effort and soft real-time applications on non-dedicated clusters
title_sort job scheduling considering best-effort and soft real-time applications on non-dedicated clusters
publishDate 2007
url http://sedici.unlp.edu.ar/handle/10915/22968
work_keys_str_mv AT hanzichmauricio jobschedulingconsideringbesteffortandsoftrealtimeapplicationsonnondedicatedclusters
AT hernandezbudeporfidio jobschedulingconsideringbesteffortandsoftrealtimeapplicationsonnondedicatedclusters
AT luquefadonemilio jobschedulingconsideringbesteffortandsoftrealtimeapplicationsonnondedicatedclusters
bdutipo_str Repositorios
_version_ 1764820467947929600