Abstract
For the efficient utilisation of a parallel system a task must be divided into sub-task and these must be assigned to the system’s resources. The temporal and spatial assignment of sub-task to the computing and communication resources of a parallel system is known as the scheduling problem.
This article proposes a new scheduling heuristic, called Simple Contention Scheduling (SCS), for arbitrary processor architectures with the consideration of link contention. The properties of the algorithm are discussed and it is compared to other existing algorithms (DLS and BSA) for arbitrary processor architectures with the consideration of contention. The comparison is done for a large set of random graphs and diffeerent architectures. Experimental results show that, while having the same or lower complexity, SCS produces in most cases better results than the other 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
Oliver Sinnen and Leonel Sousa. A comparative analysis of graph models to develop parallelising tools. In Proc. of 8th IASTED Int’l Conference on Applied Informatics (AI’2000), pages 832–838, Innsbruck, Austria, February 2000.
V. Sarkar. Partitionning and Scheduling Parallel Programs for Execution on Multiprocessors. MIT Press, Cambridge MA, 1989.
Michel Cosnard and Denis Trystram. Parallel Algorithms and Architectures. Int. Thomson Computer Press, London, UK, 1995.
H. El-Rewini and T.G. Lewis. Scheduling parallel program tasks onto arbitray target machines. Journal of Parallel and Distributed Computing, 9(2):138–153, June 1990.
A. Gerasoulis and T. Yang. A comparison of clustering heuristics for scheduling DAGs on muliprocessors. Journal of Parallel and Distributed Computing, 16(4):276–291, December 1992.
H. Kasahara and S. Narita. Practical multiprocessor scheduling algorithms for efficient parallel processing. IEEE Transactions on Computers, C-33: 1023–1029, November 1984.
Y. Kwok and I. Ahmad. Bubble Scheduling: A quasi dynamic algorithm for static allocation of tasks to parallel architectures. In Proc. of Symposium on Parallel and Distributed Processing(SPDP), pages 36–43, Dallas, Texas, USA, October 1995.
Y. Kwok and I. Ahmad. Benchmarking the task graph scheduling algorithms. In Proc. of Int. Par. Processing Symposium/Symposium on Par. and Distributed Processing (IPPS/SPDP-98), pages 531–537, Orlando, Florida, USA, April 1998.
Gilbert C. Sih and Edward A. Lee. A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Transactions on Parallel and Distributed Systems, 4(2):175–186, February 1993.
B.S. Macey and A.Y. Zomaya. A performance evaluation of CP list scheduling heuristics for communication intensive task graphs. In Parallel Processing Symposium, 1998. Proc. of IPPS/SPDP 1998, pages 538–541, 1998.
T. Yang and A. Gerasoulis. DSC: scheduling parallel tasks on an unbounded number of processors. IEEE Transactions on Parallel and Distributed Systems, 5(9):951–967, September 1994.
Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. MIT Press, Cambrige, Massachusetts, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sinnen, O., Sousa, L. (2001). Scheduling Task Graphs on Arbitrary Processor Architectures Considering Contention. In: Hertzberger, B., Hoekstra, A., Williams, R. (eds) High-Performance Computing and Networking. HPCN-Europe 2001. Lecture Notes in Computer Science, vol 2110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48228-8_38
Download citation
DOI: https://doi.org/10.1007/3-540-48228-8_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42293-8
Online ISBN: 978-3-540-48228-4
eBook Packages: Springer Book Archive