Dynamic scheduling of a batch of parallel task jobs on heterogeneous clusters
This paper addresses the problem of minimizing the scheduling length (make-span) of a batch of jobs with different arrival times. A job is described by a direct acyclic graph (DAG) of parallel tasks. The paper proposes a dynamic scheduling method that adapts the schedule when new jobs are submitted...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2011
|
| Assuntos: | |
| Texto completo: | https://hdl.handle.net/10216/95764 |
| País: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/95764 |