Preview
Unable to display preview. Download preview PDF.
References
R. Aleliunas. Randomized parallel communication. In Proc. ACM-SIGOPS Symposium on Principles of Distributed Systems, 60–72, 1982.
A. Bar-Noy, P. Raghavan, B. Schieber, and H. Tamaki. Fast deflection routing for packets and worms. To appear in 1993 ACM PODC Conference.
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.
A. Borodin and J. Hopcroft. Routing, merging, and sorting on parallel models of computation. Journal of Computer and System Sciences, 30(1):130–145, 1985.
A. Borodin, P. Raghavan, B. Schieber, and E. Upfal. How much can hardware help routing? In Proc. 25th Annual ACM Symposium on Theory of Computing, 573–582, 1993.
R. Cypher and G. Plaxton. Deterministic sorting in nearly logarithmic time on the hypercube and related computers. In Proc. 22nd Annual ACM Symposium on Theory of Computing, 193–203, 1990.
W. Dally. Network and processor architecture for message-driven computers. In Robert Suaya and Graham Birtwhistle, editors, VLSI and Parallel Computation, chapter 3, 140–222. Morgan Kaufman Publishers, San Mateo, CA, 1990.
U. Feige and P. Raghavan. Exact analysis of hot-potato routing. In Proc. 33rd Annual IEEE Symposium on Foundations of Computer Science, 553–562, 1992.
B. Hajek. Bounds on evacuation time for deflection routing. Distributed Computing, 5:1–6, 1991.
T. Han and D. Stanat. “Move and smooth” routing algorithms on mesh-connected computers. In Proc. 28th Allerton Conference, 236–245, 1990.
C. Kaklamanis, D. Krizanc and S. Rao. Simple path selection for optimal routing on processor arrays. SPAA 92, 23–30.
C. Kaklamanis, D. Krizanc and S. Rao. Improved hot potato routing for processor arrays. SPAA 93, to appear.
C. Kaklamanis, D. Krizanc, and T. Tsantilas. Tight bounds for oblivious routing in the hypercube. Math. Systems Theory, 10:223–232, 1991.
D. Krizanc. Oblivious routing with limited buffer capacity. Journal of Computer and System Sciences, 43:317–327, 1991.
F.T. Leighton. Tight bounds on the complexity of parallel sorting. IEEE Transactions on Computers, C-34(4):344–354, 1985.
F.T. Leighton. Average case analysis of greedy routing algorithms on arrays. In Proc. 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 2–10, 1990.
F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufman Publishers, San Mateo, CA, 1992.
F.T. Leighton. Methods for message routing in parallel machines. In Proc. 24th Annual ACM Symposium on Theory of Computing, 77–96, 1992.
F.T. Leighton. Personal communication.
F.T. Leighton, B. Maggs, and S. Rao. Universal packet routing algorithms. In Proc. 29th IEEE Symposium on Foundations of Computer Science, 256–269, 1988.
H. Li and Q. Stout. Reconfigurable SIMD massively parallel computers. In Proc. IEEE, 79:429–443, 1991.
B. Maggs and R. Sitaraman. Simple algorithms for routing on butterfly networks with bounded queues. In Proc. 24th Annual ACM Symposium on Theory of Computing, 150–161, 1992.
I. Newman and A. Schuster. Hot-potato algorithms for permutation routing. Technical Report #9201, CS Department, Technion, Israel, 1992.
N. Pippenger. Parallel communication with limited buffers. In Proc. 25th Annual IEEE Symposium on Foundations of Computer Science, 127–136, 1984.
N. Pippenger. Communication networks. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. A: Algorithms, and Complexity, 805–834. MIT Press, Cambridge, 1990.
R. Prager. An algorithm for routing in hypercube networks. M.Sc. thesis, University of Toronto, 1986.
M. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the ACM, 36(2):335–348, 1989.
S. Rajasekaran, and T. Tsantilas. Optimal routing algorithms for mesh-connected processor arrays. Algorithmica, 8:21–38, 1992.
A. Ranade. How to emulate shared memory. Journal of Computer and System Sciences, 42(3):307–326, 1991.
E. Upfal. Efficient schemes for parallel communication. Journal of the ACM, 31:507–517, 1984.
L. Valiant. A scheme for fast parallel communication. SIAM Journal on Computing, 11(2):350–361, 1982.
L. Valiant. Optimality of a two-phase strategy for routing in interconnection networks. IEEE Transactions on Computers, C-32(9):861–863, 1983.
L. Valiant. General purpose parallel architectures. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. A: Algorithms, and Complexity, 943–972. MIT Press, Cambridge, 1990.
L. Valiant. Personal communication.
L. Valiant and G. Brebner. Universal schemes for parallel communication. In Proc. 13th Annual ACM Symposium on Theory of Computing, 263–277, 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borodin, A. (1993). Towards a better understanding of pure packet routing. In: Dehne, F., Sack, JR., Santoro, N., Whitesides, S. (eds) Algorithms and Data Structures. WADS 1993. Lecture Notes in Computer Science, vol 709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57155-8_230
Download citation
DOI: https://doi.org/10.1007/3-540-57155-8_230
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57155-1
Online ISBN: 978-3-540-47918-5
eBook Packages: Springer Book Archive