Abstract
We present a compile time list heuristic scheduling algorithm called Low Cost Critical Path algorithm (LCCP) for the distributed memory systems. LCCP has low scheduling cost for both homogeneous and heterogeneous systems. In some recent papers list heuristic scheduling algorithms keep their scheduling cost low by using a fixed size heap and a FIFO, where the heap always keeps fixed number of tasks and the excess tasks are inserted in the FIFO. When the heap has empty spaces, tasks are inserted in it from the FIFO. The best known list scheduling algorithm based on this strategy requires two heap restoration operations, one after extraction and another after insertion. Our LCCP algorithm improves on this by using only one such operation for both the extraction and insertion, which in theory reduces the scheduling cost without compromising the scheduling performance. In our experiment we compare LCCP with other well known list scheduling algorithms and it shows that LCCP is the fastest among all.
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
Ahmed, I., Kwok, Y.-K.: A new approach to scheduling parallel programs using task duplication. In: Proc. ICCP, pp. 47–55 (1994)
Chazelle, B.: The Soft Heap: An Approximate Priority Queue with Optimal Error Rate. J. of the ACM 47, 1012–1027 (2000)
Chung, Y.C., Ranka, S.: Application and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed-memory. In: Proc. Supercomputing, pp. 512–521 (1992)
Escribano, A.G., van Gemund, A.J.C., Payo, V.C.: Performance Trade-offs in Series-Parallel Programming Models. In: CPC 2000. Proc. Eighth International Workshop on Compilers for Parallel Computers, pp. 183–189 (2000)
Graham, R.L.: Bounds on Multiprocessing timing anomalies. SIAM J. on Applied Mathematics 17, 416–429 (1969)
Gerasoulis, A., Yang, T.: A Comparison of Clustering Heuristics for Scheduling DAGs on Multiprocessors. J. of Parallel and Distributed Computing 16, 276–291 (1992)
Hwang, J., Chow, Y., Anger, E., Lee, C.: Scheduling Precedence Graphs in Systems with Interprocessor Communication Times. SIAM J. on Computing 18(2), 244–257 (1989)
Khan, A., McCreary, C., Jones, M.: A Comparison of Multiprocessor Scheduling Heuristics. ICPP 2, 243–250 (1994)
Kruatrachue, B., Lewis, T.G.: Grain size determination for parallel processing. IEEE Software, 23–32 (1988)
Kwok, Y., Ahmed, I.: Benchmarking the Task Graph scheduling Algorithms. In: Proc. IPPS/SPDP (1998)
Liou, J., Palis, M.: A Comparison of General Approaches to Multiprocessor Scheduling. In: Proc. Int’l Parallel Processing Symp, pp. 152–156 (1997)
Min-You, W., Gajski, D.: Hypertool: A Programming aid for Message-Passing Systems. IEEE Trans. Parallel and Distributed Systems 1(3) (1990)
Radulescu, A., van Gemund, A.J.C.: On the Complexity of List Scheduling Algorithms for Distributed-Memory Systems. In: ICS 1999. Proc. Int’l ACM Conf. on Supercomputing, Rhodes Greece (1999)
Radulescu, A., van Gemund, A.J.C.: Fast and Effective Task Scheduling in Heterogeneous Systems. In: Proc. HCW 2000, pp. 229–238. IEEE CS, Cancun (2000)
Sih, G., Lee, E.: A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architecture. IEEE Trans. In Parallel and distributed Systems 4(2), 75–87 (1993)
Yang, T., Gerasoulis, A.: DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Trans. on Parallel and Distributed Systems 5(9), 951–967 (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahmed, M., Chowdhury, S.M.H., Hasan, M. (2007). List Heuristic Scheduling Algorithms for Distributed Memory Systems with Improved Time Complexity. In: Rao, S., Chatterjee, M., Jayanti, P., Murthy, C.S.R., Saha, S.K. (eds) Distributed Computing and Networking. ICDCN 2008. Lecture Notes in Computer Science, vol 4904. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77444-0_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-77444-0_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77443-3
Online ISBN: 978-3-540-77444-0
eBook Packages: Computer ScienceComputer Science (R0)