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

DOI: 10.1007/3-540-64359-1_718

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1388)
Cite this paper as:
Moukrim A., Quilliot A. (1998) Scheduling with communication delays and data routing in message passing architectures. In: Rolim J. (eds) Parallel and Distributed Processing. IPPS 1998. Lecture Notes in Computer Science, vol 1388. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

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

Personalised recommendations