Scheduling with communication delays and data routing in message passing architectures

  • Aziz Moukrim
  • Alain Quilliot
Workshop on Solving Combinatorial Optimization Problems in Parallel Jena Clausen, Technical University of Denmark
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1388)


This work deals with the scheduling problem of a directed acyclic graph with interprocessor communication delays. The objective is to minimize the makespan, taking into account the contention in the network induced by the message routing. We propose two heuristics for solving the scheduling and routing problems onto arbitrary networks, taking into consideration the access conflicts to links during the task scheduling. Both heuristics significantly improve the performance of the algorithms which do not consider the contention in the network. The comparison of these heuristics is done on problems with different granularity levels in regard to execution times and number of needed processors.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chrétienne Ph., Task scheduling with interprocessor communication delays, Eur. J. Op. Res., 57, pp. 348–354, 1992.CrossRefGoogle Scholar
  2. 2.
    Chrétienne Ph., Picouleau C., Scheduling with communication delays: a survey, Scheduling Theory and its Applications, P. Chrétienne, E.G. Coffman, J.K. Lenstra, Z. Liu (Eds), John Wiley Ltd 1995.Google Scholar
  3. 3.
    El-rewini H., Lewis T.G., Scheduling Parallel Program Tasks onto Arbitrary Target Machines. J. of Parallel and Distributed Computing, 9, 1990, pp. 138–153.CrossRefGoogle Scholar
  4. 4.
    Gerasoulis A., Yang T., A Comparison of Clustering Heuristics for Scheduling DAGs on Multiprocessors, Journal of Parallel and Distributed Computing, Vol. 16, No 4, 1992, pp. 276–291.Google Scholar
  5. 5.
    Gerasoulis A. and Yang T., Efficient Algorithms and a Software Tool for Scheduling Parallel Computation, Scheduling Theory and its Applications, P. Chrétienne, E.G. Coffman, J.K. Lenstra, Z. Liu (Eds), John Wiley Ltd 1995.Google Scholar
  6. 6.
    Hwang J.J., Chow Y.C., Anger F.D., Lee C.Y., Scheduling precedence graphs in systems with interprocessor communication times, SIAM J. Comput., 18(2), pp. 244–257, 1989.Google Scholar
  7. 7.
    Kim S.J. and Browne J.C., A General Approach to Mapping of Parallel Computation upon Multiprocessor Architectures. Proc. of Inter. Conf. on Parallel Processing, Vol. 3, 1988, pp. 1–8.Google Scholar
  8. 8.
    Minoux M., Structures Algébriques généralisées des problèmes de cheminement dans les graphes. Théorèmes, algorithmes et applications, R.A.I.R:O. Rech. Op., vol. 10, No 6, 1976, pp. 33–62.Google Scholar
  9. 9.
    Moukrim A., Génération automatique de codes parallèles et nouvelles heuristiques d'Ordonnancement pour les machines à passage de messages, Thèse d'université, Université Blaise Pascal, Clermont-Ferrand, 1995.Google Scholar
  10. 10.
    Nilsson N.J., Principles of artificial intelligence, Palo Alto, CA: Tioga, 1980.Google Scholar
  11. 11.
    Papadimitriou C. and Yannakakis M., Towards on an Architecture-Independent Analysis of Parallel Algorithms, SIAM J. Comput., 19, (1990), pp. 322–328.Google Scholar
  12. 12.
    Rayward-Smith V.J., UET scheduling with interprocessor communication delays, Internal Report SYS-C86-06, School of Information Systems, University of East Anglia, Norwich, United Kingdom, 1986.Google Scholar
  13. 13.
    Sarkar V., Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors, The MIT Press, 1989.Google Scholar
  14. 14.
    Veltman B., Lageweg B.J., Lenstra J.K., Multiprocessor scheduling with communication delays, Parallel Computing 16, 1990, pp. 173–182.CrossRefGoogle Scholar
  15. 15.
    Wu M.Y., Gajski D., A programming aid for Hypercube architectures, The journal of Supercomputing. Vol 2, 1988, pp. 349–372.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Aziz Moukrim
    • 1
  • Alain Quilliot
    • 1
  1. 1.Université de Clermont II, LIMOSAubiére Cedex

Personalised recommendations