Abstract
Packet routing is an important problem in parallel computation since a single step of inter-processor communication can be thought of as a packet routing task. In this paper we present an optimal algorithm for packet routing on a mesh-connected computer.
Two important criteria for judging a routing algorithm will be 1) its run time, i.e., the number of parallel steps it takes for the last packet to reach its destination, and 2) its queue size, i.e., the maximum number of packets that any node will have to store at any time during routing. We present a 2n−2 step routing algorithm for an n×n mesh that requires a queue size of only 58.
The previous best known result is a routing algorithm with the same time bound but with a queue size of 672. The time bound of 2n−2 is optimal. A queue size of 672 is rather large for practical use. We believe that the queue size of our algorithm is practical. The improvement in the queue size is possible due to (from among other things) a new 3s+o(s) sorting algorithm for an s×s mesh.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Kunde, M., ‘Optimal Sorting on Multi-Dimensionally Mesh-Connected Computers,’ STACS 1987, Springer-Verlag Lecture Notes in Computer Science 247, pp. 408–419.
Kunde, M., ‘Routing and Sorting on Mesh-Connected Arrays,’ VLSI Algorithms and Architectures: Proc. AWOC 1988, Springer-Verlag Lecture Notes in Computer Science 319, pp. 423–433.
Leighton, T., Makedon, F., and Tollis, I.G., ‘A 2n − 2 Step Algorithm for Routing in an n × n Array With Constant Size Queues,’ Proc. 1989 ACM Symposium on Parallel Algorithms and Architectures, pp. 328–335.
Pippenger, N., ‘Parallel Communication with Limited Buffers,’ Proc. IEEE Symposium on Foundations Of Computer Science, 1984, pp. 127–136.
Rajasekaran, S., and Tsantilas, T., ‘Optimal Routing Algorithms For Mesh-Connected Processor Arrays,’ submitted to Algorithmica, 1989.
Ranade, A.G., ‘How to Emulate Shared Memory,’ Proc. IEEE Symposium on Foundations Of Computer Science, 1987, pp. 185–194.
Schnorr, C., and Shamir, A., ‘An Optimal Sorting Algorithm for Mesh Connected Computers,’ Proc. 18th Annual ACM Symposium on Theory Of Computing, 1986, pp. 255–263.
Thompson, C., and Kung, H.T., ‘Sorting on a Mesh-Connected Parallel Computer,’ CACM, vol. 20, 1977, pp. 263–270.
Upfal, E., ‘Efficient Schemes for Parallel Communication,’ J. ACM 31, 3, 1984, pp. 507–517.
Valiant, L.G., and Brebner, G.J., ‘Universal Schemes for Parallel Communication,’ Proc. ACM Symposium on Theory Of Computing, 1981, pp. 263–277.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rajasekaran, S., Overholt, R. (1991). Constant queue routing on a mesh. In: Choffrut, C., Jantzen, M. (eds) STACS 91. STACS 1991. Lecture Notes in Computer Science, vol 480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020819
Download citation
DOI: https://doi.org/10.1007/BFb0020819
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53709-0
Online ISBN: 978-3-540-47002-1
eBook Packages: Springer Book Archive