Randomized routing with shorter paths

IEEE Transactions on Parallel and Distributed Systems

Volumn 7, Issue 4, 1996, Pages 356-362

  Upfal, Eli ^b,c   Felperin, Sergio ^d   Snir, Marc ^a,e  

^a IEEE

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^d IBM System Architecture Group   (Argentina)

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

Author keywords

Butterfly networks; Interconnection networks; Multistage networks; Packet switching; Parallel communication; Randomized routing

Indexed keywords

COMPUTER NETWORKS; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; PACKET SWITCHING; PARALLEL PROCESSING SYSTEMS; PROBABILITY; RANDOM PROCESSES;

BUTTERFLY NETWORKS; MULTISTAGE NETWORKS; PARALLEL COMMUNICATION; RANDOMIZED ROUTING;

INTERCONNECTION NETWORKS;

EID: 0030121134     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.494630     Document Type: Article

References (17)

1. R. Aleliunas, "Randomized Parallel Communication," ACM-SIGOPS Symp. Principles of Distributed Systems, pp. 60-72, 1982.
2. H. Chernoff, "A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations," Annals of Math. Stat., vol. 23, pp. 493-509, 1952.
3. W. Feller, An Introduction to Probability Theory and its Applications, vol. 2. John Wiley & Sons, 1966.
4. I. Hagerup and C. Rüb, "A Guided Tour of Chernoff Bounds," Information Processing Letters, vol. 33, pp. 305-308, 1989/90.
5. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Tress, Hypercubes. San Mateo, Calif.: Morgan Kaufmann Publishers, 1992.
6. C.E. Leiserson, et al, "The Network Architecture of the Connection Machine CM 5," Fourth Ann. ACM Symp. Parallel Algorithms and Architectures, pp. 272-285, 1992.
7. D. Mitra and R.A. Cieslak, "Randomized Parallel Communications on an Extension of the Omega Network," J. ACM, vol. 34, pp. 802-824, 1987.
8. P. Peleg and E. Upfal, "A Time-Randomness Tradeoff for Oblivious Routing," SIAM J. Computing, vol. 19, pp. 256-266, 1990.
9. N. Pippenger, "Parallel Communication with Limited Buffers," 25th Ann. Symp. Foundations of Computer Science, pp. 127-136, 1984.
10. W.H. Press, Numerical Recipes in C: The Art of Scientific Computing. Cambridge Univ. Press, 1988.
11. A. Ranade, "How to Emulate Shared Memory," Proc. 28th Ann IEEE Symp. Foundations of Computer Science, pp. 185-194, 1987.
12. H.J. Siegel, Interconnection Networks for Large-Scale Parallel Processing. Lexington Books, 1985.
13. C.B. Stunkel, D.G. Shea, D.G. Grice, P.H. Hochschild, and M. Tsao, "The SP1 high-performance switch," Proc. 1994 Scalable High-Performance Computing Conf., pp. 150-157, 1994.
14. L.G. Valiant and G.J. Brebner, "Universal Schemes for Parallel Communication," Proc. 13th Ann. ACM Symp. Theory of Computing, pp. 263-277, 1981.
15. L.G. Valiant, "A Scheme for Fast Parallel Communication," SIAM J. Computing, vol. 11, no. 2, pp. 350-361, 1982.
16. E. Upfal, "Efficient Schemes for Parallel Communication," J. ACM, vol. 31, pp. 507-517, 1984.
17. Eli Upfal, "An O(log N) Deterministic Packet Routing Scheme," 21st ACM Ann. Symp. Theory of Computing, pp. 241-250, 1989.