Task assignment on distributed-memory systems with adaptive wormhole routing

Assignment of tasks of a parallel program onto processors of a distributed-memory system is critical to obtain minimal program completion time by minimizing communication overhead. The paper presents task assignment heuristics for wormhole-routed systems. A Temporal Communication Graph is used to model task graphs and to identify spatial and temporal link contention. The interplay between degree of routing adaptivity, topology, application characteristics, and task assignment is studied by evaluating random task graphs using an event-driven simulator. The study indicates that even for systems supporting fully-adaptive routing, efficient task assignment is necessary to reduce program completion time, especially for communication-bound applications.<<ETX>>

[1]  José Duato.  Deadlock-free adaptive routing algorithms for multicomputers: evaluation of a new algorithm , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

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

[3]  Sanjay V. Rajopadhye,et al.  OREGAMI: Software Tools for Mapping Parallel Computations to Parallel Architectures , 1990, ICPP.

[4]  Scott F. Midkiff,et al.  Heuristic Technique for Processor and Link Assignment in Multicomputers , 1991, IEEE Trans. Computers.

[5]  Marios D. Dikaiakos,et al.  Message Ordering in Multiprocessors with Synchronous Communication , 1992, International Conference on Parallel Processing.

[6]  M. Cosnard,et al.  Clustering Task Graphs for Message Passing Architectures , 1990 .

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

[8]  Herb Schwetman,et al.  Introduction to process-oriented simulation and CSIM , 1990, 1990 Winter Simulation Conference Proceedings.

[9]  Andrew A. Chien,et al.  Planar-adaptive routing: low-cost adaptive networks for multiprocessors , 1992, ISCA '92.

[10]  William J. Dally.  Virtual-channel flow control , 1990, ISCA '90.

[11]  James C. Browne,et al.  General approach to mapping of parallel computations upon multiprocessor architectures , 1988 .

[12]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[13]  P. Sadayappan,et al.  Task allocation onto a hypercube by recursive mincut bipartitioning , 1988, C3P.