A Bottom-Up Approach to Task Scheduling on Distributed Memory Multiprocessors

This paper presents a new approach to statically schedule parallel programs modeled as Directed Acyclic Graphs (DAGs) on various distributed memory multi-processor topologies represented as processor graphs to reduce the overall execution time of the program. The scheduler factors in the processor topology, communication delays and delays due to channel conflicts for scheduling. Our scheme differs dramatically from existing schedulers in that tasks of the DAG are scheduled bottom up. Experimental results presentedfor message switched systems using the hypercube and torus topologies show the effectiveness of our scheme. Our scheme can also be adapted for other topologies and routing schemes such as wormhole routing and circuit switching.

[1]  Loren Schwiebert,et al.  Mapping to reduce contention in multiprocessor architectures , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

[2]  Shahid H. Bokhari,et al.  A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor System , 1981, IEEE Transactions on Software Engineering.

[3]  Daniel Gajski,et al.  Hypertool: A Programming Aid for Message-Passing Systems , 1990, IEEE Trans. Parallel Distributed Syst..

[4]  Tetsuji Satoh,et al.  Task scheduling on a hypercube with link contentions , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

[5]  Hesham El-Rewini,et al.  Scheduling Parallel Program Tasks onto Arbitrary Target Machines , 1990, J. Parallel Distributed Comput..

[6]  Jake K. Aggarwal,et al.  A Generalized Scheme for Mapping Parallel Algorithms , 1993, IEEE Trans. Parallel Distributed Syst..

[7]  Jake K. Aggarwal,et al.  A Mapping Strategy for Parallel Processing , 1987, IEEE Transactions on Computers.

[8]  Kanad Ghose,et al.  Scheduling Task Graphs Onto Distributed Memory Multiprocessors Under Realistic Constaints , 1994, PARLE.

[9]  Tao Yang,et al.  A Comparison of Clustering Heuristics for Scheduling Directed Acycle Graphs on Multiprocessors , 1992, J. Parallel Distributed Comput..

[10]  T. C. Hu.  Parallel Sequencing and Assembly Line Problems , 1961 .

[11]  Kanad Ghose,et al.  A universal approach for task scheduling for distributed memory multiprocessors , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.