Simple algorithms for routing on butterfly networks with bounded queues

SIAM Journal on Computing

Volumn 28, Issue 3, 1999, Pages 984-1003

  Maggs, Bruce M ^a   Sitaraman, Ramesh K ^b  

^a Carnegie Mellon University   (United States)

^b The Manning College of Information and Computer Sciences   (United States)

Author keywords

Circuit switching; Communication protocols; Interconnection networks; Parallel computers; Performance analysis; Routing algorithms

Indexed keywords

ALGORITHMS; NETWORK PROTOCOLS; PACKET NETWORKS; PACKET SWITCHING; PARALLEL PROCESSING SYSTEMS; QUEUEING NETWORKS; QUEUEING THEORY; ROUTERS;

BOUNDED QUEUES; BUTTERFLY NETWORKS; PARALLEL COMPUTERS; ROUTING;

INTERCONNECTION NETWORKS;

EID: 0032284175     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0097539796311818     Document Type: Article

References (34)

1. W. A. AIELLO, F. T. LEIGHTON, B. M. MAGGS, AND M. NEWMAN, Fast algorithms for bit-serial routing on a hypercube, Math. Systems Theory, 4 (1991), pp. 253-271.
2. R. ALELIUNAS, Randomized parallel communication, in Proceedings of the ACM SIGACTSIGOPS Symposium on Principles of Distributed Computing, 1982, pp. 60-72.
3. D. ANGLUIN AND L. G. VALIANT, Fast probabilistic algorithms for Hamiltonian circuits and matchings, J. Comput. System Sci., 18 (1979), pp. 155-193.
4. K. BATCHER, Sorting networks and their applications, in Proceedings of the AFIPS Spring Joint Computing Conference, 32 (1968), pp. 307-314.
5. Butterfly™ Parallel Processor Overview, BBN report 6148, Version 1, Bolt, Beranek, and Newman, Cambridge, MA, 1986.
6. A. BORODIN AND J. E. HOPCROFT, Routing, merging, and sorting on parallel models of computation, J. Comput. System Sci., 30 (1985), pp. 130-145.
7. A. Z. BRODER, A.M. FRIEZE, AND E. UPFAL, A general approach to dynamic packet routing with bounded buffers, in Proceedings of the ACM Symposium on Theory of Computing, 1996, ACM, New York, pp. 390-399.
8. S. FELPERIN, P. RAGHAVAN, AND E. UPFAL, A theory of wormhole routing in parallel computers, in Proceedings 33rd IEEE Symposium on Foundations of Computer Science, IEEE Press, Piscataway, NJ, 1992, pp. 563-572.
9. A. GOTTLIEB, An overview of the NYU Ultracomputer Project, in Experimental Parallel Computing Architectures, J. J. Dongarra, ed., Elsevier Science Publishers, B. V., Amsterdam, The Netherlands, 1987, pp. 25-95.
10. W. HOEFFDING, On the distribution of the number of successes in independent trials, Ann. Math. Statistics, 27 (1956), pp. 713-721.
11. R. R. KOCH, Increasing the size of a network by a constant factor can increase performance by more than a constant factor, in Proceedings of the 29th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1988, pp. 221-230.
12. C. P. KRUSKAL AND M. SNIR, The performance of multistage interconnection networks for multiprocessors, IEEE Trans. Comput., C-32(12) (1983), pp. 1091-1098.
13. F. T. LEIGHTON, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, San Mateo, CA, 1992.
14. F. T. LEIGHTON, B. M. MAGGS, A. G. RANADE, AND S. B. RAO, Randomized Routing and Sorting on Fixed-Connection Networks, J. Algorithms, 17 (1994), pp. 157-205.
15. T. LEIGHTON, B. MAGGS, AND S. RAO, Universal packet routing algorithms, in Proceedings of the 29th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, 1988, pp. 256-271.
16. B. M. MAGGS AND R. K. SITARAMAN, Simple algorithms for routing on butterfly networks with bounded queues, in Proceedings of the 24th Annual ACM Symposium on Theory of Computing, ACM, New York, 1992, pp. 150-161.
17. A. MERCHANT, A Markov chain approximation for the analysis of banyan networks, in Proceedings of the ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, ACM, New York, 1991.
18. T. NAKATA, S. MATSUSHITA, N. TANABE, N. KAJIHARA, H. ONOZUKA, Y. ASANO, AND N. KOIKE, Parallel programming on Cenju: A multiprocessor system for modular circuit simulation, NEC Research & Development, Princeton, NJ, 1991, pp. 421-429.
19. G. F. PFISTER, W. C. BRANTLEY, D. A. GEORGE, S. L. HARVEY, W. J. KLEINFELDER, K. P. MCAULIFFE, E. A. MELTON, V. A. NORTON, AND J. WEISS, An introduction to the IBM Research Parallel Processor Prototype (RP3), in Experimental Parallel Computing Architectures, J. J. Dongarra, ed., Elsevier Science Publishers, B. V., Amsterdam, The Netherlands, 1987, pp. 123-140.
20. N. PIPPENGER, Parallel communication with limited buffers, in Proceedings of the 25th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, 1984, pp. 127-136.
21. P. RAGHAVAN, Lecture Notes on Randomized Algorithms, Res. report RC 15340 (#68237), IBM Research Division, T. J. Watson Research Center, Yorktown Heights, NY, 1990.
22. A. G. RANADE, Constrained Randomization for Parallel Communication, Tech. report YALEU/DCS/TR-511, Department of Computer Science, Yale University, New Haven, CT, 1987.
23. A. G. RANADE, Equivalence of Message Scheduling Algorithms for Parallel Communication, Tech. report YALE/DCS/TR-512, Department of Computer Science, Yale University, New Haven, CT, 1987.
24. A. G. RANADE, How to emulate shared memory, J. Comput. System Sci., 42 (1991), pp. 307-326.
25. R. REHRMANN, B. MONIEN, R. LULING, AND R. DIEKMANN, On the communication throughput of buffered multistage interconnection networks, in Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, ACM, New York, 1996, pp. 152-161.
26. R. ROOHOLAMINI, V. CHERKASSKY, AND M. GARVER, Finding the right ATM switch for the market, IEEE Comput., 27 (1994), pp. 16-28.
27. G. D. STAMOULIS AND J. N. TSITSIKLIS, The efficiency of greedy routing in hypercubes and butterflies, in Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, ACM, New York, 1991, pp. 248-259.
28. H. SUZUKI, H. NAGANO, T. SUZUKI, T. TAKEUICHI, AND S. IWASAKI, Output-buffer switch architecture for asynchronous transfer mode, in Proceedings of the 1989 IEEE International Conference on Communications, IEEE Press, Piscataway, NJ, 1989, pp. 99-103.
29. T. SZYMANSKI AND S. SHAIKH, Markov chain analysis of packet-switched banyans with arbitrary switch sizes, queue sizes, link multiplicities and speedups, in Proceedings of the IEEE INFOCOM '89, IEEE Press, Piscataway, NJ, 1989, pp. 960-971.
30. A. M. TSANTILAS, Communication Issues in Parallel Computation, Ph.D. thesis, Harvard University, Cambridge, MA, 1990.
31. E. UPFAL, Efficient schemes for parallel communication, J. Assoc. Comput. Mach., 31 (1984), pp. 507-517.
32. L. G. VALIANT, A scheme for fast parallel communication, SIAM J. Comput., 11 (1982), pp. 350-361.
33. L. G. VALIANT, General purpose parallel architectures, in Handbook of Theoretical Computer Science, J. van Leeuwen, Ed., Elsevier Science Publishers, B. V., Amsterdam, The Netherlands, 1990, pp. 943-971.
34. L. G. VALIANT AND G. J. BREBNER, Universal schemes for parallel communication, in Proceedings of the 13th Annual ACM Symposium on Theory of Computing, ACM, New York, 1981, pp. 263-277.