Abstract
Clusters and grids have increasingly become standard platforms for high performance computing as they provide extremely high execution rates with great cost effectiveness. Such systems are designed to support concurrent execution of multiple jobs. It calls for multiprogrammed scheduling of the different jobs for effective system utilization and for keeping average response times low. Although a significant amount of work has been done in scheduling parallel jobs on multiprocessor systems, the problem of scheduling parallel tasks of an individual job on a multiprogrammed parallel system has not been given enough attention so far. In this paper, we present a dynamic scheduling technique for scheduling iterations of a DOALL loop (of a single application) to achieve load balance between a given set of processors. Experimental results show the effectiveness of our approach.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Conway, R.W., Maxwell, W.L., Miller, L.W.: Theory of scheduling. Addison- Wesley, Reading (1967)
Feitelson, D.G.: A survey of scheduling in multiprogrammed parallel systems. Technical Report RC 19790(87657), IBM T. J. Watson Research Center (February 1995)
Majumdar, S., Eager, D.L., Bunt, R.B.: Scheduling in multiprogrammed parallel systems. In: Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems, Santa Fe, NM, pp. 104–113 (1988)
Lundstrom, S., Barnes, G.: A controllable MIMD architectures. In: Proceedings of the 1980 International Conference on Parallel Processing, St. Charles, IL (August 1980)
Kruskal, C.P., Weiss, A.: Allocating independent subtasks on parallel processors. IEEE Transactions on Software Engineering 11(10), 1001–1016 (1985)
Smith, B.J.: Architecture and applications of the HEP multiprocessor computer system. In: Proceedings of SPIE - Real-Time Signal Processing IV, pp. 241–248 (1981)
Kejariwal, A., Nicolau, A.: Reading list of self-scheduling of parallel loops, http://www.ics.uci.edu/~akejariw/SelfScheduleReadingList.pdf
Kejariwal, A., Nicolau, A., Polychronopoulos, C.D.: Accounting for ”Gaps” in processor availability during self-scheduling of parallel loops on multiprogrammed parallel computers. Technical Report TR-05-14, School of Information and Computer Science, University of California at Irvine (October 2005)
Polychronopoulos, C.D., Kuck, D.J.: Guided self-scheduling: A practical scheduling scheme for parallel supercomputers. IEEE Transactions on Computers 36(12), 1425–1439 (1987)
Markatos, E., LeBlanc, T.: Using processor affinity in loop scheduling on sharedmemory multiprocessors. IEEE Transactions on Parallel and Distributed Systems 5(4), 379–400 (1994)
Zhang, Y., Burcea, M., Cheng, V., Ho, R., Voss, M.: An adaptive OpenMP loop scheduler for hyperthreaded SMPs. In: Proceedings of the 17th International Conference for Parallel and Distributed Computing Systems, San Francisco, CA (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kejariwal, A., Nicolau, A., Polychronopoulos, C.D. (2006). An Efficient Approach for Self-scheduling Parallel Loops on Multiprogrammed Parallel Computers. In: Ayguadé, E., Baumgartner, G., Ramanujam, J., Sadayappan, P. (eds) Languages and Compilers for Parallel Computing. LCPC 2005. Lecture Notes in Computer Science, vol 4339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69330-7_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-69330-7_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69329-1
Online ISBN: 978-3-540-69330-7
eBook Packages: Computer ScienceComputer Science (R0)