A theory of wormhole routing in parallel computers

IEEE Transactions on Computers

Volumn 45, Issue 6, 1996, Pages 704-713

  Felperin, Sergio ^a,b   Raghavan, Prabhakar ^a,c   Upfal, Eli ^a,d  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^c IBM T J WATSON RESEARCH CENTER   (United States)

^d WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Butterfly; Communication networks; Flow control; Mesh; Parallel processing; Probabilistic analysis; Routing

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; COMPUTER SIMULATION; PACKET SWITCHING; PARALLEL PROCESSING SYSTEMS; PROBABILITY;

PACKET ROUTING; RANDOM INITIAL DELAYS; WORMHOLE ROUTING;

DATA COMMUNICATION SYSTEMS;

EID: 0030169269     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.506426     Document Type: Article

References (28)

1. B. Aiello, F.T. Leighton, B. Maggs, and M. Newman, "Fast Algorithms for Bit-Serial Routing on a Hypercube," Second Ann. ACM Symp. Parallel Algorithms and Architectures, pp. 55-64. ACM Press, 1990.
2. R. Aleliunas, "Randomized Parallel Communication," ACM-SIGOPS Symp. Principles of Distributed Systems, pp. 60-72, 1982.
3. W.C. Athas, "Physically Compact, High Performance Multicomputer," Sixth MIT Conf. Advanced Research in VLSI, pp. 302-313. MIT Press, 1990.
4. H. Chernoff, "A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations," Annals of Math. Statistics, vol. 23, pp. 493-509, 1952.
5. A.A. Chien, "Congestion Control in Routing Networks," MS Thesis, MIT, 1986.
6. W. Dally, "Performance Analysis of k ary n Cube Interconnection Networks," IEEE Trans. Computers, vol. 39, pp. 775 785, 1990.
7. W. Dally and H. Aoki, "Deadlock Free Adaptive Routing in Multicomputer Networks Using Virtual Channels," IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 466-475, 1993.
8. W. Dally and C.L. Seitz, "Deadlock Free Message Routing in Multiprocessor Interconnection Networks," IEEE Trans. Computers, vol. 36, pp. 547-553, 1987.
9. W.J. Dally, "Fine Grain Message Passing Concurrent Computers," Third Conf. Hypercube Concurrent Computers and Applications, pp. 2-12. ACM Press, 1988.
10. W.J. Dally, "Virtual Channel Flow Control," 17th Ann. Int'l Symp. Computer Architecture, pp. 60-68. ACM Press, 1990.
11. J. Duato, "On the Design of Deadlock Free Adaptive Routing Algorithms for Multicomputers: Theoretical Aspects," Second European Conf. Distributed Memory Computing, pp. 234-243. Springer-Verlag, LNCS 487, 1991.
12. U. Feige and P. Raghavan, "Exact Analysis of Hot Potato Routing. 33rd Ann. Symp. Foundations of Computer Science, pp. 553-562, Oct. 1992.
13. J. Kim and C.R. Das, "Modeling Wormhole Routing in a Hypercube," 11th Int'l Conf. Distributed Computing Systems, pp. 386-393, 1991.
14. F.T. Leighton, "Average Case Analysis of Greedy Routing Algorithms on Arrays," Second Ann. ACM Symp. Parallel Algorithms and Architectures, pp. 2-10. ACM Press, 1990.
15. F.T. Leighton, Introduction to Parallel Algorithms and Architectures. San Mateo, Calif.: Morgan Kaufmann, 1992.
16. F. Makedon and A. Simvonis, "On Bit-Serial Packet Routing for the Mesh and the Torus," Third Symp. Frontiers of Massively Parallel Computation, pp. 294-302. IEEE CS Press, 1990.
17. I. Newman and A. Schuster, "Hot-Potato Worm Routing is Almost as Easy as Store-and-Forward Packet Routing," Proc. Second Israel Symp. Theory and Computing Systems, pp. 202-211, 1993.
18. M. Noakes and W.J. Dally, "System Design of the j Machine," Sixth MIT Conf. Advanced Research in VLSI, pp. 179-194. MIT Press, 1990.
19. N. Pippenger, "Parallel Communication with Limited Buffers," 25th Ann. Symp. Foundations of Computer Science, pp. 127-136, 1984.
20. W.H. Press, Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, 1988.
21. A. Ranade, "How to Emulate Shared Memory," Proc. 28th Ann. IEEE Symp. Foundations of Computer Science, pp. 185-194, 1987.
22. D.S. Reeves, E.F. Gehringer, and A. Chandiramani, "Adaptive Routing and Deadlock Recovery: a Simulation Study," Fourth Conf. Hypercube Concurrent Computers and Applications, pp. 331-337. Golden Gate Enterprises, 1989.
23. C.L. Seitz, W.C. Athas, C.M. Flaig, A.J. Martin, J. Seizovic, C.S. Steele, and W.K. Su, "The Architecture and Programming of the Ametek Series 2010 Multicomputer, Third Conf. Hypercube Concurrent Computers and Applications, pp. 33-36. ACM Press, 1988.
24. R.J. Smith II, "Experimental System Kit Hardware," Fourth Conf. Hypercube Concurrent Computers and Applications, pp. 713-725. Golden Gate Enterprises, 1989.
25. E. Upfal, "Efficient Schemes for Parallel Communication, J. ACM, vol. 31, pp. 507-517, 1984.
26. Eli Upfal, "An O(log N) Deterministic Packet Routing Scheme," J. ACM, pp. 55-70, 1992.
27. L.G. Valiant and G.J. Brebner, "Universal Schemes for Parallel Communication," Proc. 13th Ann. ACM Symp. Theory of Computing, pp. 263-277, Milwaukee, Wisconsin, May 1981.
28. L.G. Valiant, "A Scheme for Fast Parallel Communication," SIAM J. Computing, vol. 11, no. 2, pp. 350-361, 1982.