An efficient adaptive scheduling policy for high-performance computing
Abawajy, J. H. 2009, An efficient adaptive scheduling policy for high-performance computing, Future generation computer systems, vol. 25, no. 3, pp. 364-370.
Attached Files
(Some files may be inaccessible until you login with your Deakin Research Online credentials)
Name
Description
MIMEType
Size
Downloads
Title
An efficient adaptive scheduling policy for high-performance computing
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.
Language
eng
Field of Research
080501 Distributed and Grid Systems
Socio Economic Objective
890299 Computer Software and Services not elsewhere classified