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...
Guardado en:
| 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: |
Ejemplares similares
-
Applying backfilling over a non-dedicated cluster
por: Hanzich, Mauricio, et al.
Publicado: (2005) -
Multiobjective evolutionary algorithms for job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001) -
An improved ant colony algorithm for the job shop scheduling problem
por: Leguizamón, Guillermo, et al.
Publicado: (2002) -
CISNE-P: a portable and integral approach for scheduling parallel jobs on non-dedicated clusters
por: Torchinsky, Matías, et al.
Publicado: (2006) -
Facing the job shop scheduling problem wih hybrid evolutionary algorithms
por: Salto, Carolina, et al.
Publicado: (2001)