Methods for message routing in parallel machines

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129722, Issue , 1992, Pages 77-96

  Leighton, Tom ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIBLIOGRAPHIES; COMPUTER ARCHITECTURE; COMPUTER NETWORKS; DATA COMMUNICATION SYSTEMS; DATA HANDLING; INFORMATION MANAGEMENT; INFORMATION THEORY; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PARALLEL PROCESSING SYSTEMS;

MESSAGE ROUTING;

ALGORITHMS;

EID: 0027004046     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/129712.129721     Document Type: Conference Paper

References (91)

1. F. Abolhassan, J. Keller, and W. Paul. On the cost-effectiveness and realization of the theoretical PRAM model. Technical Report 09/1991, FB Informatik, Universität des Saarlandes, 1991.
2. A. Aggarwal, A. Chandra, and M. Snir. On communication latency in PRAM computations. In Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures, June 1989. To appear in SIAM J. of Computing.
3. A. Aggarwal, A. Chandra, and M. Snir. Communication complexity of PRAMs. In Theoretical Computer Science, volume 71, pages 3-28, 1990.
4. M. Ajtai, J. Komlos, and E. Szemeredi. Sorting in clogn parallel steps. Combinatorica, 3:1-19, 1983.
5. R. Aleliunas. Randomized parallel communication. In ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 60-72, August 1982.
6. G. Almasi and A. Gottlieb. Highly Parallel Computing. Benjamin Cummings, Redwood City, CA, 1989.
7. B. Alpern, L. Carter, E. Feig, and T. Selker. A uniform memory hierarchy model of computation. Technical report, IBM Watson, December 1990.
8. S. Arora, T. Leighton, and B. Maggs. On-line algorithms for path selection in a nonblocking network. In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, pages 149158, 1990.
9. Y. Aumann and A. Schuster. Deterministic PRAM simulation with constant memory blow-up and no time-stamps. In Third Symposium on the Frontiers of Massively Parallel Computation, pages 2229, 1990.
10. L.A. Bassalygo and M.S. Pinsker. Complexity of an optimum non-blocking switching network without reconnections. Problems of Information Transmission, 9:64-66, 1974.
11. V. Benes. Permutation groups, complexes, and re-arrangeable multistage connecting networks. Bell System Technical Journal, 43:1619-1640, July 1964.
12. Guy E. Bielloch. Vector Models for Data-Parallel Computing. MIT Press, Cambridge, MA, 1990.
13. A. Borodin and J. Hopcroft. Routing, merging, and sorting on parallel models of computation. Journal of Computer and System Sciences, 30(1):130-145, r.k...v loas
14. A. Chin. Practical issues in parallel complexity. PhD thesis, U. Oxford, England, November 1991.
15. F. Chong, E. Egozy, and A. DeHon. Fault tolerance and performance of multipath multistage interconnection networks. In T.F. Knight, Jr. and J. Savage, editors, Advanced research in VLSI and Parallel Systems 1992. MIT Press, March 1992. To appear.
16. Frederic T. Chong and Thomas Knight, Jr. Design and performance of multipath MIN architectures. Technical Report 64, MIT Artificial Intelligence Laboratory, February 1992.
17. R. Cole and O. Zajicek. The APRAM: incorporating asynchrony into the PRAM model. In Proceedings lai ACM Symposium on Parallel Algorithms and Architecture, pages 169-178, 1989.
18. R. Cole and O. Zajicek. The expected advantage of asynchrony. In 2nd ACM SPAA, pages 85-94, 1990.
19. W. Dally. Network and processor architecture for message-driven computers. In Robert Suaya and Graham Birtwhistle, editors, VLSI and Parallel Computation, chapter 3, pages 140-222. Morgan Kaufman Publishers, San Mateo, CA, 1990.
20. W. Dally. Express cubes: improving the performance of fc-ary n-cube interconnection networks. IEEE Transactions on Computers, 1991. To appear.
21. W. Dally. Virtual-channel flow control. IEEE Transactions on Parallel and Distributed Systems, 1991. To appear.
22. W. Dally and C. Seitz. Deadlock free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, C-36(5):547-553, May 1987.
23. A. DeHon, T. Knight, Jr., and H. Minsky. Fault-tolerant design for multistage routing networks. In Proceedings of the International Symposium on Shared Memory Multiprocessing. Information Processing Society of Japan, April 1991.
24. André DeHon. Mbta: Modular bootstrapping transit architecture. Technical Report 17, MIT Artificial Intelligence Laboratory, April 1990.
25. F. Fich. The complexity of computing on a parallel random access machine. In John Reif, editor, Synthesis of Parallel Algorithms. Morgan Kaufman Publishers, San Mateo, CA, 1992. To Appear.
26. F. Fich, R. Impagliazzo, B. Kapron, V. King, and M. Kutylowski. Limits on the power of PRAMs with weak forms of write conflict resolution. Unpublished manuscript, 1992.
27. F. Fich, P. Ragde, and A. Wigderson. Relations between concurrent write models of parallel computation. SIAM J. Computation, 17(3):606-627, 1988.
28. P. Gibbons. The Asynchronous PRAM: a Semisyn-chronous Model for Shared Memory MIMD Machine. PhD thesis, U.C. Berkeley, 1989.
29. A. Gottlieb. An overview of the NYU ultracomputer project. In J. Dongarra, editor, Experimental Computing Architecture, pages 25-95. Elsevier, Amsterdam, 1987.
30. Ronald I. Greenberg. Efficient Interconnection Schemes for VLSI and Parallel Computation. PhD thesis, MIT, September 1989.
31. Ronald I. Greenberg and Charles E. Leiserson. Randomized routing on fat-trees. Advances in Computing Research, 5:345-374, 1989.
32. T. Hagerup and T. Radzik. Every robust CRCW PRAM can efficiently simulate a priority PRAM. In Proc. 2nd ACM Symp. on Parallel Algorithms and Architectures, pages 117-124, 1990.
33. J. Hâstad, T. Leighton, and M. Newman. Fast computation using faulty hypercubes. In Proceedings of the Twenty-F irsi Annual ACM Symposium on Theory of Computing, pages 251-263, May 1989.
34. J. Hennessy and D. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufmann Publishers, San Mateo, CA, 1990.
35. A. Huang and S. Knauer. Starlite: a wideband digital switch. In Proc. GLOBECOM84, pages 121125, December 1984.
36. N. Kahale. Better expansion for ramamujan graphs. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, pages 398-404. IEEE, October 1991.
37. C. Kaklamanis, D. Krizanc, and T. Tsantilas. Tight bounds for oblivious routing in the hypercube. In Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, pages 31-36, July 1990.
38. A. Karlin, M. Manasse, L. Rudolph, and D. Sleator. Competitive snoopy caching. Algorithmica, 3:79119, 1988.
39. A. Karlin and E. Upfal. Parallel hashing-an efficient implementation of shared memory. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pages 160-168, May 1986.
40. R. Karp. Parallel combinatorial computing. In Jill P. Mesirov, editor, Very Large Scale Computation in the 21st Century, pages 221-238, Philadelphia, PA, 1991. SIAM Press.
41. P. Klein, A. Agrawal, R. Ravi, and S. Rao. Approximation through multicommodity flow. In Proc. 31st FOCS, pages 726-737, 1990.
42. R. Koch. Increasing the size of a network by a constant factor can increase performance by more than a constant factor. In 29th Annual Symposium on Foundations of Computer Science, pages 221230. IEEE, October 1988.
43. R. Koch. An Analysis of the Performance of Interconnection Networks for Multiprocessor Systems. PhD thesis, MIT, May 1989.
44. S. Konstantinidou and E. Upfal. Experimental comparison of multistage networks. Technical report, IBM Almadén Research Center, 1991.
45. C. Kruskal and M. Snir. The performance of multistage interconnection networks for multiprocessors. IEEE Transactions on Computers, C-32(12):1091-1098, December 1983.
46. C. Kruskal and M. Snir. A unified theory of interconnection network structure. Theoretical Computer Science, 48(l):75-94, 1986.
47. M. Kunde. Routing and sorting on mesh-connected arrays. In J. Reif, editor, Proceedings, 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, volume 319 oí Lecture Notes in Computer Science, pages 423-433. Springer-Verlag, July 1988.
48. F. Thomson Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufman Publishers, San Mateo, CA, 1992.
49. T. Leighton. Tight bounds on the complexity of parallel sorting. IEEE Transactions on Computers, C-34(4):344-354, April 1985.
50. T. Leighton. Average case analysis of greedy routing algorithms on arrays. In Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, pages 2-10, July 1990.
51. T. Leighton, CL. Leiserson, and M. Klugerman. Theory of parallel and VLSI computation. Research Seminar Series Report MIT/LCS/RSS10, MIT Laboratory for Computer Science, May 1991.
52. T. Leighton, D. Lisinski, and B. Maggs. Empirical evaluation of randomly-wired multistage networks. In Proceedings of the 1990 IEEE International Conference on Computer Design, pages 380385. IEEE, September 1990.
53. T. Leighton and B. Maggs. Expanders might be practical: Fast algorithms for routing around faults in multibutterflies. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 384-389. IEEE, October 1989.
54. T. Leighton and B. Maggs. Fast algorithms for routing around faults in multibutterflies and randomly-wired splitter networks. In IEEE Trans, on Computers, 1992. To Appear.
55. T. Leighton and B. Maggs. Introduction to Parallel Algorithms and Architectures: Expanders, PRAMs and VLSI. Morgan Kaufman Publishers, San Mateo, CA, 1993. To appear.
56. T. Leighton, B. Maggs, A. Ranade, and S. Rao. Randomized algorithms for routing and sorting in fixed-connection networks. J. Algorithms, 1992. To appear.
57. T. Leighton, B. Maggs, and S. Rao. Universal packet routing algorithms. In 29th Annual Symposium on Foundations of Computer Science, pages 256-271. IEEE, October 1988.
58. T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In 29th Annual Symposium on Foundations of Computer Science, pages 422-431. IEEE, October 1988.
59. C. Leiserson and et.al. The network architecture of the connection machine CM-5. Unpublished manuscript, 1992.
60. Charles E. Leiserson. Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Transactions on Computers, C-34(10):892-901, October 1985.
61. Charles E. Leiserson. VLSI theory and parallel supercomputing. In Richard F. Rashid, editor, Carnegie Mellon University School of Computer Science 25th Anniversery Symposium, pages 29-44. Addison-Wesley, 1991.
62. Charles E. Leiserson and Bruce M. Maggs. Communication-efficient parallel algorithms for distributed random-access machines. Algorithmica, 3:53-77, 1988.
63. H. Li and Q. Stout. Reconfigurable SIMD massively parallel computers. In Proc. IEEE, volume 79, pages 429-443, 1991.
64. A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8(3):261-277, 1988.
65. Y.-D. Lyuu. Fast fault-tolerant parallel communication and on-line maintenance using information dispersal. In Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, pages 378-387, July 1990.
66. Y.-D. Lyuu. An Information Dispersal Approach to Issues in Parallel Processing. PhD thesis, Harvard University, 1990.
67. B. Maggs and R. Sitaraman. Simple algorithms for routing on butterfly networks with bounded queues. In Proc. 1992 ACM STOC, 1992. To appear.
68. Henry Minsky, André DeHon, and Thomas F. Knight, Jr. RN1: Low-latency, dilated, crossbar router. In Hot Chips Symposium III, 1991.
69. D. Nassimi and S. Sahni. A self-routing Benes network and parallel permutation algorithms. IEEE Transactions on Computers, C-30(5):332-340, May 1981.
70. J. Ngai and C. Seitz. A framework for adaptive routing in multicomputer networks. In Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures, pages 1-9, June 1989.
71. N. Nishimura. Asynchronous shared memory parallel computation. In 2nd ACM SPAA, pages 76-84, 1990.
72. N. Pippenger. Telephone switching networks. In Proc. of AMS Symposia in Applied Mathematics, volume 26, pages 101-133, 1982.
73. N. Pippenger. Parallel communication with limited buffers. In 25th Annual Symposium on Foundations of Computer Science, pages 127-136. IEEE, October 1984.
74. N. Pippenger. Communication networks. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. A: Algorithms, and Complexity, pages 805-834. MIT Press, Cambridge, 1990.
75. D. Pountain. The Transputer strikes back. Byte Magazine, pages 265-275, August 1991.
76. F. Preparata. Holographic dispersal and recovery of information. IEEE Trans. Information Theory, IT-35(5): 1123-1124, September 1989.
77. M. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the ACM, 36(2):335-348, April 1989.
78. A. Ranade. How to emulate shared memory. In 28th Annual Symposium on Foundations of Computer Science, pages 185-194. IEEE, October 1987.
79. A. Ranade. Fluent Parallel Computation. PhD thesis, Yale University, New Haven, CT, 1988.
80. A. Ranade, S. Bhatt, and L. Johnsson. The fluent abstract machine. In Advanced Research in VLSI: Proceedings of the Fifth MIT Conference, pages 7194. MIT Press, Cambridge, MA, March 1988.
81. R. Rettberg, W. Crowther, P. Carvey, and R. Tom-linson. The monarch parallel processor hardware design. Computer, 23(4): 18-30, April 1990.
82. B. Smith. A massively parallel shared memory machine. In 3rd ACM SPAA, 1991. Invited lecture.
83. G. Stamoulis and J. Tsitsiklis. The efficiency of greedy routing in hypercubes and butterflies. In Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, July 1991. To appear.
84. F. Tobagi. Fast packet switch architectures for broadband integrated services digital networks. In Proc. IEEE, volume 78, pages 133-167, January 1990.
85. T. Tsantilas. A refined analysis of the Valiant-Brebner algorithm. Technical Report TR-22-89, Center for Research in Computing Technology, Harvard University, 1989.
86. E. Upfal. Efficient schemes for parallel communication. In ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 55-59, August 1982.
87. E. Upfal. An 0(log N) deterministic packet routing scheme. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 241250, May 1989. Also to appear in J ACM.
88. L. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, August 1990.
89. L. Valiant and G. Brebner. Universal schemes for parallel communication. In Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, pages 263-277, May 1981.
90. L.G. Valiant. General purpose parallel architectures. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. A: Algorithms, and Complexity, pages 943-972. MIT Press, Cambridge, 1990.
91. A. Waksman. A permutation network. Journal of the ACM, 15(1):159-163, January 1968.