Application-specific deadlock free wormhole routing on multicomputers
We show that given a priori knowledge of the messages to be routed for a specific parallel application, efficient algorithms can be designed to generate low message traffic congestion and deadlock free routings at compile-time. The problem can be formulated as a graph theoretic problem. Since the problem of finding a deadlock free routing with minimal maximum message traffic congestion is shown to be NP-hard, an efficient heuristic is proposed. Performance of the heuristic for both random message distribution and for several specific applications on hypercube and torus topologies is evaluated by simulations. We show that, compared with the E-cube and XY fixed routings, the heuristic has significant improvement with respect to maximum congestion for the specific applications as well as for the nonuniform message distribution case which models communication locality. For the uniform message distribution case, the heuristic has moderate improvement.
Unable to display preview. Download preview PDF.
- [AHU74]A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The design and analysis of computer algorithms. Addison-Wesley Publishing Company, 1974.Google Scholar
- [AS88]W.C. Athas and C.L. Seitz. Multicomputers:Message-passing Concurrent Computers. IEEE Computer, pages 9–23, August 1988.Google Scholar
- [BCC+90]S. Borkar et al. Supporting systolic and memory communication in iWarp. In Proceedings of the 17th Annual International Symposium on Computer Architecutre, pages 70–81, May 1990.Google Scholar
- [BS87b]B.P. Bianchini and J.P. Shen. Interprocessor traffic scheduling algorithm for multiprocessor networks. IEEE Trans. Comput., C-36(4):396–409, Apr. 1987.Google Scholar
- [DS87]W.J. Dally and C.L. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. Comput., C-36(5):547–553, May 1987.Google Scholar
- [Har72]F. Harary. Graph theory. Addison-Wesley Publishing Company, 1972.Google Scholar
- [JMY89]C.R. Jesshope, P.R. Miller, and J.T. Yantchev. High performance communications in processor networks,. In Proceedings of the 16th Annual International Symposium on Computer Architecutre, pages 150–157, June 1989.Google Scholar
- [JR90]D.V. Judge and W.G. Rudd. A test case for the parallel programming support environment: parallelizing the analysis of satellite imagery data, Technical Report, Dept. of CS, Oregon State University, 1990.Google Scholar
- [KS90]D.D. Kandlur and K.G. Shin. Traffic routing for multi-computer networks with virtual cut-through capability, In Preceedings of the 10th International Conference on Distributed Computer Systems, pages 398–405, May 1990.Google Scholar
- [LRG+92]V.M. Lo, S. Rajopadhye, S. Gupta, D. Kelsen, M.A. Mohamed, J. Telle, and X. Zhong. OREGAMI: tools for mapping parallel computations to parallel architectures. International Journal of Parallel Programming, 1992. to appear.Google Scholar
- [SA91]S.B. Shukla and D.P. Agrawal. Scheduling pipelined communication in distributed memory multiprocessors for real-time applications, In Proceedings of the 18th Annual International Symposium on Computer Architecutre, pages 222–231, May 1991.Google Scholar
- [ZL92]Xiaoxiong Zhong and Virginia M. Lo. Application-specific deadlock free wormhole routing on multicomputers. Technical Report, CIS-92-03, Computer Science Dept., University of Oregon, January 1992.Google Scholar