Static communication scheduling for minimizing collisions in application specific parallel systems

In applications requiring very high throughput or which have real-time deadlines, the use of parallel processing techniques has become widespread. Although there exists potential for vast performance gains, the communication overhead inherent in such systems can significantly lessen these gains. In this paper, with tightly-coupled architectures as the platform, the static communication scheduling of messages in the network is addressed. The compile time determination of when nodes should send their messages to other nodes is what is termed static communication scheduling. In parallel systems the static scheduling of computational tasks has been studied for some time, however an in depth analysis of our problem is very new. This paper builds a framework based on the newly developed collision graph model. Using this model, the determination of an optimal schedule is proven to be NP-Complete. Several efficient algorithms are designed to deal with a general case model of message traffic, and experiments show a significant improvement over baseline approaches.

[1]  Matt W. Mutka,et al.  Priority based real-time communication for large scale wormhole networks , 1994, Proceedings of 8th International Parallel Processing Symposium.

[2]  David S. Edwin,et al.  Application Specific Communication Scheduling on Parallel Systems , 1995 .

[3]  Edwin H.-M. Sha,et al.  Communication Scheduling for messages with varying departure times using the Collision Graph Model , 1995 .

[4]  John Paul Shen,et al.  Interprocessor Traffic Scheduling Algorithm for Multiple-Processor Networks , 1987, IEEE Transactions on Computers.

[5]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[6]  Edwin Hsing-Mean Sha,et al.  Optimal communication scheduling based on collision graph model , 1996, 1996 IEEE International Conference on Acoustics, Speech, and Signal Processing Conference Proceedings.

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

[8]  Edwin Hsing-Mean Sha,et al.  Communication sensitive rotation scheduling , 1994, Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[9]  Jong Kim,et al.  Path Selection for Communicating Tasks in a Wormhole-Routed Multicomputer , 1994, ICPP.

[10]  Christos H. Papadimitriou,et al.  A Communication-Time Tradeoff , 1987, SIAM J. Comput..

[11]  Hesham El-Rewini,et al.  Parallax: a tool for parallel program scheduling , 1993, IEEE Parallel & Distributed Technology: Systems & Applications.

[12]  Dan I. Moldovan,et al.  Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays , 1986, IEEE Transactions on Computers.

[13]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[14]  Kang G. Shin,et al.  Real-Time Communication in Multihop Networks , 1994, IEEE Trans. Parallel Distributed Syst..

[15]  Hesham H. Ali,et al.  Task scheduling in parallel and distributed systems , 1994, Prentice Hall series in innovative technology.

[16]  Keshab K. Parhi,et al.  Generalized ILP scheduling and allocation for high-level DSP synthesis , 1993, Proceedings of IEEE Custom Integrated Circuits Conference - CICC '93.