Abstract
We study multipacket routing problems. We divide the multipacket routing problem into two classes, namely, distance limited and bisection limited routing problems. Then, we concentrate on rings of processors. Having a full understanding of the multipacket routing problem on rings is essential before trying to attack the problem for the more general case of r-dimensional meshes and tori. We prove a new lower bound of 2n/3 routing steps for the case of distance limited routing problems. We also give an algorithm that tightens this lower bound. For bisection limited problems, we present an algorithm that completes the routing in near optimal time.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. Aielo, F.T. Leighton, B. Maggs, M. Newman, “Fast Algorithms for Bit-Serial Routing on a Hypercube”, Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '90, July 2–6, 1990, Crete, Greece.
D. Krizanc, S. Rajasekaran, Th. Tsantilas, “Optimal Routing Algorithms for Mesh-Connected Processor Arrays”, VLSI Algorithms and Architectures (AWOC'88), J. Reif, editor, Lecture Notes in Computer Science 319, 1988, pp. 411–422.
M. Kunde, “Routing and Sorting on Mesh-Connected Arrays”, VLSI Algorithms and Architectures (AWOC'88), J. Reif, editor, Lecture Notes in Computer Science 319, 1988, pp. 423–433.
M. Kunde,T. Tensi, “Multi-Packet Routing on Mesh Connected Arrays”, Proceedings of ACM Symposium on Parallel Algorithms and Architectures, SPAA'89, June 1989, pp. 336–343.
F.T. Leighton, “Average Case Analysis of Greedy Routing Algorithms on Arrays”, Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '90, July 2–6, 1990, Crete, Greece.
F.T. Leighton, F. Makedon, I.G. Tollis, “A 2n-2 Algorithm for Routing in n×n Array With Constant Size Queues”, Proceedings of ACM Symposium on Parallel Algorithms and Architectures, SPAA'89, June 1989, pp. 328–335.
F. Makedon, A. Simvonis, “Fast Parallel Communication on Mesh Connected Machines with Low Buffer Requirements”, Proceedings of the 1990 IEEE International Conference on Computer Design (ICCD '90).
F. Makedon, A. Simvonis, “On Bit-Serial Packet Routing for the Mesh and the Torus”, Proceedings of the 3rd Symposium on the Frontiers of Massively Parallel Computation, October 8–10 1990, pp. 294-302.
J.Y. Ngai,C.L. Seitz, “A Framework for Adaptive Routing in Multicomputer Networks”, Proceedings of ACM Symposium on Parallel Algorithms and Architectures, SPAA'89, June 1989, pp. 1–9.
S. Rajasekaran, R. Overholt, “Constant Queue Routing on a Mesh”, to appear in the Journal of Parallel and Distributed Computing.
A.G. Ranade, “How to Emulate Shared Memory”, Proceedings of the 28th IEEE Symposium on Foundation of Computer Science, 1987, pp. 185–194.
L.G. Valiant, G.J. Brebner, “Universal Schemes for Parallel Communication”, Proceedings of the 13th Annual ACM Symposium on the Theory of Computing, May 1981, pp. 263–277.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Makedon, F., Simvonis, A. (1992). Multipacket routing on rings. In: Zima, H.P. (eds) Parallel Computation. ACPC 1991. Lecture Notes in Computer Science, vol 591. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55437-8_83
Download citation
DOI: https://doi.org/10.1007/3-540-55437-8_83
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55437-0
Online ISBN: 978-3-540-47073-1
eBook Packages: Springer Book Archive