Paper Info
Title
An Adaptive Space-Sharing Scheduling Algorithm for PC-Based Clusters.
Abstract
In recent years, PC-based cluster has become a mainstream branch in high performance computing (HPC) systems. To improve performance of PC-based cluster, various scheduling algorithms have been proposed. However, they only focused on systems with all jobs are rigid or all jobs are moldable. This paper fills in the gap by building a scheduling algorithm for PC-based clusters running both rigid jobs and moldable jobs. As an extension of existing adaptive space-sharing solutions, the proposed scheduling algorithm helps to reduce the turnaround time. In addition, the algorithm satisfies some requirement about job-priority. Evaluation results show that even in extreme cases such as all jobs are rigid or all jobs are moldable, performance of the algorithm is competitive to the original algorithms.
Year
DOI
Venue
2006
10.1007/978-3-540-79409-7_14
MODELING, SIMULATION AND OPTIMIZATION OF COMPLEX PROCESSES
Field
DocType
Citations 
Cluster (physics),First come first serve,Fair-share scheduling,Supercomputer,Scheduling (computing),Computer science,Space sharing,Turnaround time,Distributed computing
Conference
0
PageRank 
References 
Authors
0.34
11
3
Name
Order
Citations
PageRank
Doan Viet Hung110.69
Nam Thoai27018.86
Nguyen Thanh Son3357.03