Abstract
In modern parallel and distributed systems, the time for exchanging data is usually larger than that for computing elementary operations. Consequently, these communications slow down the execution of the application scheduled on such systems. Accounting for these communications is essential for attaining efficient hardware and software utilization. Therefore, we provide in this paper a new combined approach for scheduling parallel applications with large communication delays on an arbitrary number of processors. In this approach, a genetic algorithm is improved with the introduction of some extra knowledge about the scheduling problem. This knowledge is represented by a class of clustering algorithms introduced recently, namely, convex clusters which are based on structural properties of the parallel applications. The developed algorithm is assessed by simulations run on some families of synthetic task graphs and randomly generated applications. The comparison with related approaches emphasizes its interest.
Chapter PDF
Similar content being viewed by others
References
Sinnen, O.: Task Scheduling for Parallel Systems. Wiley-Interscience, NJ (2007)
Sarkar, V.: Partitioning and Scheduling Parallel Programs for Multiprocessors. MIT Press, Cambridge (1989)
Kianzad, V., Bhattacharyya, S.S.: Efficient techniques for clustering and scheduling onto embedded multiprocessors. IEEE TPDS 17(7), 667–680 (2006)
Lepère, R., Trystram, D.: A new clustering algorithm for large communication delays. In: Proc. 11th IPDPS 2002, Fort Lauderdale, Florida, April 2002, pp. 68–73 (2002)
Mahjoub, A., Pecero, J.E., Trystram, D.: Scheduling with uncertainties on new computing platforms. Journal Comput. Optim. Appl. (to appear)
Rayward-Smith, V.J.: Uet scheduling with unit interprocessor communication delays. Discrete Applied Mathematics 18(1), 55–71 (1987)
Yang, T., Gerasoulis, A.: Dsc: Scheduling parallel tasks on an unbounded number of processors. IEEE TPDS 5(9), 951–967 (1994)
McCreary, C., Gill, H.: Automatic determination of grain size for efficient parallel processing. Comm. of ACM 32(9), 1073–1078 (1989)
Goldberg, D.E.: Genetic algorithms in search, optimization, machine learning. Addison-Wesley, Boston (1989)
Zomaya, A.Y., Ercal, F., Olariou, S. (eds.): Solutions to parallel and distributed computing problems: Lessons from biological sciences. Wiley, NY (2001)
Zomaya, A.Y., Chan, G.: Efficient clustering for parallel tasks execution in distributed systems. In: Proc. NIDISC 2004, IPDPS (April 2004)
Falkenauer, E.: Genetic algorithms and grouping problems. John Wiley and Sons Ltd., England (1999)
Kwok, Y.K., Ahmad, I.: Benchmarking and comparison of the task graph scheduling algorithms. JPDC 59(3), 381–422 (1999)
Hwang, J.J., Chow, Y.C., Angers, F.D., Lee, C.Y.: Scheduling precedence graphs in systems with interprocessor communication times. SIAM Journal on Computing 18(2), 244–257 (1989)
Kitajima, J.P., Plateau, B., Bouvry, P., Trystram, D.: Andes: Evaluating mapping strategies with synthetic programs. J. of Syst. Arch. 42(5), 351–365 (1996)
Winkler, P.: Random orders. Order 1, 317–331 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pecero, J.E., Trystram, D., Zomaya, A.Y. (2009). A New Genetic Algorithm for Scheduling for Large Communication Delays. In: Sips, H., Epema, D., Lin, HX. (eds) Euro-Par 2009 Parallel Processing. Euro-Par 2009. Lecture Notes in Computer Science, vol 5704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03869-3_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-03869-3_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03868-6
Online ISBN: 978-3-642-03869-3
eBook Packages: Computer ScienceComputer Science (R0)