ROMM routing: A class of efficient minimal routing algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 853 LNCS, Issue , 1994, Pages 187-199

  Nesson, Ted ^a   Johnsson, Lennart ^a,b  

^a HARVARD UNIVERSITY   (United States)

^b SUN MICROSYSTEMS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CUBE NETWORKS; EXTENSIVE SIMULATIONS; HEAVY LOADS; RANDOMIZED ALGORITHMS;

ROUTING ALGORITHMS;

EID: 85028452482     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58429-3_37     Document Type: Conference Paper

References (33)

1. F. Abolhassan, R. Drefenstedt, J. Keller, W. Paul, and D. Scheerer. On the Physical Design of PRAMs. Computer Journal, 36(8):756–762, December 1993.
2. K. Bolding et al. The Chaos Router Chip: Design and Implementation of an Adaptive Router. In Proceedings of VLSI ‘93, September 1993.
3. M.Y. Chan. Embedding of grids into optimal hypercubes. SIAM J. Computing, 20(5):834–864, 1991.
4. W. Dally and H. Aoki. Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels. IEEE Trans. on Parallel and Distributed Systems, 4(4):466–475, April 1993.
5. W. Dally and C. Seitz. Deadlock-Free Message Routing in Multiprocessor Interconnection Networks. IEEE Trans. on Computers, C-36(5):547–553, May 1987.
6. P. Gaughan and S. Yalamanchili. Adaptive Routing Protocols for Hypercube Interconnection Networks. COMPUTER, 26(5):12–23, May 1993.
7. W. Daniel Hillis. The Connection Machine. MIT Press, Cambridge, MA, 1985.
8. Ching-Tien Ho and S. Lennart Johnsson. Embedding meshes in Boolean cubes by graph decomposition. J. of Parallel and Distributed Computing, 8(4):325–339, April 1990.
9. Ching-Tien Ho, M.T. Raghunath, and S. Lennart Johnsson. An efficient algorithm for Gray-to-binary permutation on hypercubes. Journal of Parallel and Distributed Computing, 20(1):114–120, 1994.
10. S. Lennart Johnsson. Communication efficient basic linear algebra computations on hypercube architectures. J. Parallel Distributed Computing, 4(2):133–172, April 1987.
11. S. Lennart Johnsson. Minimizing the communication time for matrix multiplication on multiprocessors. Parallel Computing, 19(11):1235–1257, 1993.
12. S. Lennart Johnsson and Ching-Tien Ho. Matrix transposition on Boolean n-cube configured ensemble architectures. SIAM J. Matrix Anal. Appl., 9(3):419–454, July 1988.
13. C. Kaklamanis, D. Krizanc, and T. Tsantilas. Tight Bounds for Oblivious Routing in the Hypercube. In Proc. of the 2nd Annual ACM Symp. on Parallel Algorithms and Architectures, pages 31–36. ACM Press, July 1990.
14. P. Kermani and L. Kleinrock. Virtual Cut-Through: A New Computer Communication Switching Technique. Computer Networks, 3:267–286, 1979.
15. S. Konstantinidou. Adaptive, Minimal Routing in Hypercubes. Technical Report TR-89-11-01, Computer Science Dept., Univ. of Washington, Seattle, WA, 1989.
16. S. Konstantinidou and L. Snyder. The Chaos Router: A Practical Application of Randomization in Network Routing. In Proc. of the 2nd Annual ACM Symp. on Parallel Algorithms and Architectures, pages 21–30. ACM Press, July 1990.
17. T. Leighton. Parallel Algorithms and Architectures: Arrays, Trees, and Hypercubes. Morgan Kaufmann, San Mateo, California, 1992.
18. C. Leiserson et al. The Network Architecture of the Connection Machine CM-5. In Proc. of the 4th Annual ACM Symp. on Parallel Algorithms and Architectures, pages 272–285. ACM Press, July 1992.
19. Y.-D. Lyuu. An Information Dispersal Approach to Issues in Parallel Processing. PhD thesis, Harvard University, 1990.
20. T. Nesson and L. Johnsson. ROMM: Randomized, Oblivious, Multi-Phase, Minimal Routing. Unpublished Manuscript, Harvard University, December 1993.
21. J. Ngai and C. Seitz. A Framework for Adaptive Routing in Multicomputer Networks. In Proc. of the 1st Annual ACM Symp. on Parallel Algorithms and Architectures, pages 1–9. ACM Press, June 1989.
22. M. Pertel. A Critique of Adaptive Routing. Technical Report CS-TR-92-06, Dept. of Computer Science, California Institute of Technology, Pasadena, CA, 1992.
23. G. Pifarré, L. Gravano, S. Felperin, and J. Sanz. Fully-Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and Other Networks. In Proc. of the 3rd Annual ACM Symp. on Parallel Algorithms and Architectures, pages 278–290. ACM Press, July 1991.
24. Abhiram Ranade. How to emulate shared memory. In Proceedings of the 28th Annual Symposium on the Foundations of Computer Science, pages 185–194. IEEE Computer Society, October 1987.
25. Abhiram G. Ranade, Sandeep N. Bhatt, and S. Lennart Johnsson. The Fluent abstract machine. In Advanced Research in VLSI, Proceedings of the fifth MIT VLSI Conference, pages 71–93. MIT Press, 1988.
26. Quentin F. Stout and Bruce Wagar. Passing messages in link-bound hypercubes. In Michael T. Heath, editor, Hypercube Multiprocessors 1987. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1987.
27. H. Sullivan and T. Brashkow. A Large Scale Homogeneous Machine. In Proc. of the 4th International Symp. on Computer Arch., pages 105–124. IEEE, 1977.
28. A. Tannenbaum. Computer Networks. Prentice Hall, Englewood Cliffs, New Jersey, second edition, 1989.
29. Thinking Machines Corp. CM-5 Technical Summary, 1991.
30. Thinking Machines Corp. CMSSL for CM Fortran, Version 3.0, 1992.
31. A. Tsantilas. A Refined Analysis of the Valiant-Brebner Algorithm. Technical Report TR-22-89, Center for Research in Computing Technology, Harvard University, Cambridge, MA, 1989.
32. L. Valiant. A Scheme for Fast Parallel Communication. SIAM Journal on Computing, 11(2):350–361, May 1982.
33. L. Valiant and G. Brebner. Universal Schemes for Parallel Communication. In Proc. of the 13th Annual ACM Symp. on the Theory of Computing, pages 263–277. ACM Press, May 1981.