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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
W. Cirne and F. Berman. Adaptive Selection of Partition Size for Super- computer Requests. Lecture Notes in Computer Science, Springer, Vol. 1911, 187-208 (2000).
W. Cirne and F. Berman. A Model for Moldable Supercomputer Jobs. Proc. of IPDPS-01 (2001).
W. Cirne and F. Berman. Using Moldability to Improve the Performance of Supercomputer Jobs. Journal of Parallel and Distributed Computing, Vol. 62, 1571-1601 (2002).
W. Cirne and F. Berman. A Comprehensive Model of the Supercomputer Workload. Proc. of IEEE 4th Annual Workshop on Job Scheduling Strategies for Parallel Processing (2005).
A. B. Downey. A Model for Speedup of Parallel Programs. U.C. Berkerley Technical Report CSD-96-933 (1997).
D. G. Feitelson. The Parallel Workloads Archive. http://www.cs.huji.ac.il/labs/parallel/workload/
D. G. Feitelson and L. Rudolph. Parallel Job Scheduling - A Status Report. Lecture Notes in Computer Science, Springer, Vol. 3277 (2005).
D. G. Feitelson and L. Rudolph. Toward Convergence in Job Schedulers for Parallel Supercomputers. Lecture Notes in Computer Science, Springer, Vol. 1162, 1-26 (1996).
C. B. Lee, Y. Schwartzman, J. Hardy, and A. Snavely. Are User Runtime Estimates Inherently Inaccurate? Proc. of the 10th Job Scheduling Strategies for Parallel Processing (2004).
S. T. Leutenegger and M. K. Vernon. The Performance of Multiprogrammed Multiprocessor Scheduling Policies. Proc. of ACM Sigmetrics Conference, 226-236 (1990).
S. Majumdar, D. L. Eager, and R. B. Bunt. Scheduling in Multiprogrammed Parallel Systems. Proc. of ACM Sigmetrics Conference, 104-113 (1988).
E. Rosti, E. Smirni, L. W. Dowdy, G. Serazzi, and B. M. Carlson. Robust Partitioning Policies for Multiprocessor Systems. Performance Evaluation, Vol. 19, 141-265 (1994).
U. Schwiegelshohn and R. Yahyapour. Analysis of Fist-Come-First-Serve Parallel Job Scheduling. Proc. of the 9th SIAM Symposium on Discrete Algorithms, 629-638 (1998).
P. D. Sivarama and H. Yu. Performance Sensitivity of Space-Sharing Processor Scheduling in Distributed-Memory Multicomputers. Proc. of IPPS/SPDP ’98, 403-409 (1998).
SimGrid project. http://simgrid.gforge.inria.fr
S. Srinivasan, V. Subramani, R. Kettimuthu, P. Holenarsipur, and P. Sadayappan. Effective Selection of Partition Sizes for Moldable Scheduling of Parallel Jobs. Lecture Notes In Computer Science, Springer, Vol. 2552, 174-183 (2002).
S. Srinivasan, S. Krishnamoorthy, and P. Sadayappan. A Robust Scheduling Strategy for Moldable Scheduling of Parallel Jobs. Proc. of 2003 IEEE International Conference On Cluster Computing (2003).
N. Thoai, T. D. Toan, and T. V. N. Tuong. Resource Management and Scheduling on Supernode II. Proc. of COSCI’05, 137-147 (2005).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Doan, V.H., Thoai, N., Son, N.T. (2008). An Adaptive Space-Sharing Scheduling Algorithm for PC-Based Clusters. In: Bock, H.G., Kostina, E., Phu, H.X., Rannacher, R. (eds) Modeling, Simulation and Optimization of Complex Processes. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79409-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-79409-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79408-0
Online ISBN: 978-3-540-79409-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)