Abstract
Task scheduling is an essential aspect of parallel process system. Most heuristics for this NP-hard problem assume fully connected homogeneous processors and ignore contention on the communication links. Actually, contention for communication resources has a strong influence on the execution time of a parallel program in arbitrary network topology heterogeneous system. This paper investigates the incorporation of contention awareness into task scheduling. The innovation is the idea of dynamic scheduling edges to links, which we use the earliest communication finish time search algorithm based on shortest-path search algorithm. The other novel idea proposed in this paper is scheduling priority based on recursive rank computation on heterogeneous arbitrary architectures. The comparison study, based on randomly generated graphs, shows that our scheduling algorithm significantly surpass classic and static communication contention awareness algorithm, especially for high data transmission rate parallel application
Supported by the National Natural Science Foundation of China under Grant Nos. 60273075 and the Key Project of Ministry of Education of China under Grant No.05128.
An erratum to this chapter can be found at http://dx.doi.org/10.1007/11914952_55.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Sih, G.C., Lee, E.A.: A compile-time scheduling heuristic for interconnection-constrained heterogeneous machine architectures. IEEE Trans. Parallel Distrib. Systems 4(2), 175–187 (1993)
Gary, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., San Francisco (1979)
Ahmad, I., Kwok, Y.-K.: On exploiting task duplication in parallel program scheduling. IEEE Trans. Parallel Distrib. Systems 9(9), 872–892 (1998)
Dhodhi, M.K., Ahmad, I., Yatama, A., Ahmad, I.: An integrated technique for task matching and scheduling onto distributed heterogeneous computing system. J. Parallel Distrib. Comput. 62(9), 1338–1361 (2002)
Kim, D., Yi, B.G.: A two-pass scheduling algorithm for parallel programs. Parallel Comput. 20(6), 869–885 (1994)
Sinnen, O., Sousa, L.A.: Communication contention in task scheduling. IEEE Trans. Parallel Distrib. Systems 16(6), 503–515 (2005)
Oliver, S., Sousa, Leonel: List scheduling: extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures. Parallel Computing 30(1), 81–101 (2004)
El-Rewini, H., Lewis, T.G.: Scheduling parallel program tasks onto arbitrary target machines. J. Parallel Distrib. Comput. 9(2), 138–153 (1990)
Liu, G.Q., Poh, K.L., Xie, M.: Iterative list scheduling for heterogeneous computing. Journal of Parallel and Distributed Computing 65(5), 654–665 (2005)
Iverson, M., Ozuner, F., Follen, G.: Parallelizing existing applications in a distributed heterogeneous environment. In: Proceedings of Heterogeneous Computing Workshop, pp. 93–100 (1995)
Topcuoglu, H., Hariri, S., Wu, M.-Y.: Performance-effective and low complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Systems 13(3), 260–274 (2002)
Macey, B.S., Zomaya, A.Y.: A performance evaluation of CP list scheduling heuristics for communication intensive task graphs. In: Parallel Processing Symposium, 1998, Proceedings of IPPS/SPDP 1998, pp. 538–541 (1998)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)
Culler, D.E., Singh, J.P.: Parallel Computer Architecture. Morgan Kaufmann Publishers, San Francisco (1999)
Sinnen, O., Sousa, L.: Exploiting unused time slots in list scheduling considering communication contention. In: Sakellariou, R., Keane, J.A., Gurd, J.R., Freeman, L. (eds.) Euro-Par 2001. LNCS, vol. 2150, pp. 166–170. Springer, Heidelberg (2001)
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
Tang, X., Li, K., Xiao, D., Yang, J., Liu, M., Qin, Y. (2006). A Dynamic Communication Contention Awareness List Scheduling Algorithm for Arbitrary Heterogeneous System. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems 2006: CoopIS, DOA, GADA, and ODBASE. OTM 2006. Lecture Notes in Computer Science, vol 4276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11914952_19
Download citation
DOI: https://doi.org/10.1007/11914952_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48274-1
Online ISBN: 978-3-540-48283-3
eBook Packages: Computer ScienceComputer Science (R0)