An efficient adaptive scheduling policy for high-performance computing
Data(s) |
01/03/2009
|
---|---|
Resumo |
The advent of commodity-based high-performance clusters has raised parallel and distributed computing to a new level. However, in order to achieve the best possible performance improvements for large-scale computing problems as well as good resource utilization, efficient resource management and scheduling is required. This paper proposes a new two-level adaptive space-sharing scheduling policy for non-dedicated heterogeneous commodity-based high-performance clusters. Using trace-driven simulation, the performance of the proposed scheduling policy is compared with existing adaptive space-sharing policies. Results of the simulation show that the proposed policy performs substantially better than the existing policies.<br /> |
Identificador | |
Idioma(s) |
eng |
Publicador |
Elsevier BV |
Relação |
http://dro.deakin.edu.au/eserv/DU:30029100/abawajy-efficientadaptive-2009.pdf http://dx.doi.org/10.1016/j.future.2006.04.007 |
Direitos |
2006, Elsevier B.V. |
Palavras-Chave | #Distributed systems #Commodity cluster computing #Space-sharing #Job scheduling #Heterogeneous systems #Performance analysis |
Tipo |
Journal Article |