Abstract
In this paper we consider deterministic hot-potato routing algorithms on n×n meshes and tori. We present algorithms for the permutation routing problem on these networks and achieve new upper bounds. The basic ideas used in the presented algorithms are sorting, packet concentration and fast algorithms for one-dimensional submeshes. Using this ideas we solve the permutation routing problem in 3.25n + o(n) steps on an n×n mesh and in 2.75n + o(n) steps on an n×n torus.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Acampora, A.S., Shah, S.I.A.: Multihop Lightwave Networks: Acomparison of Store-and-Forward and Hot-Potato Routing. In: Proceedings of IEEE INFOCOM, pp. 10–19 (1991)
Ben-Aroya, I., Eilam, T., Schuster, A.: Greedy Hot-Potato Routing on the Two-Dimensional Mesh. Distributed Computing 9(1), 3–19 (1995)
Borodin, A., Rabani, Y., Schieber, B.: Beterministic Many-To-Many Hot Potato Routing. Theory of Computer Systems 31(1), 41–61 (1998)
Ben-Or, A., Halevi, S., Schuster, A.: Randomized Single-Target Hot-Potato Routing. Journal of Algorithms 23(1), 101–120 (1997)
Busch, C., Herlihy, M., Wattenhofer, R.: Randomized Greedy Hot-Potato Routing. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), San Francisco, Calefornia, USA, January 2000, pp. 458–466 (2000)
Busch, C., Herlihy, M., Wattenhofer, R.: Hard-potato Routing. In: Proceedings of the Thirty-second Annual ACM Symposium on Theory of Computing (STOC 2000), Portland, Oregon, USA, May 2000, pp. 278–285 (2000)
Feige, U., Raghavan, P.: Exact Analysis of Hot-Potato Routing. In: IEEE Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (FOCS 1992), Pittsburgh, Pennsylvania, USA, October 1992, pp. 553–562 (1992)
Grammatikakis, M.D., Hsu, D.F., Sibeyn, J.F.: Packet routing in fixed-connection networks: A survey. Journal of Parallel and Distributed Computing 54(2), 77–132 (1998)
Greenber, A.G., Goodmann, J.: Sharp Approximate Models of Deflection Routing in Mesh Networks. IEEE Transactions on Communications 41(1), 210–223 (1993)
Hillis, W.D.: The Connection Machine. MIT Press, Cambridge (1985)
Kaufmann, M., Lauer, H., Schröder, H.: Fast Deterministic Hot-Potato Routing on Meshes. In: Du, D.-Z., Zhang, X.-S. (eds.) ISAAC 1994. LNCS, vol. 834, pp. 273–282. Springer, Heidelberg (1994)
Kaufmann, M., Rajasekaran, S., Sibeyn, J.F.: Matching the Bisection Bound for Routing and Sorting on the Mesh. In: Proceedings of the 4th Symposium on Parallel Algorithms and Architectures (SPAA 1992), pp. 31–40 (1992)
Knuth, D.: The Art of Computer Programming, Sorting and Searching, vol. III. Addison-Wesley, Reading (1973)
Kunde, M.: A New Bound for Pure Greedy Hot Potato Routing. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 49–60. Springer, Heidelberg (2007)
Leighton, T.: Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes. Morgan-Kaufmann Publishers, San Francisco (1992)
Newman, I., Schuster, A.: Hot-Potato Algorithms for Permutation Routing. IEEE Transactions on Parallel and Distributed Systems 6(11), 1168–1176 (1995)
Schnorr, C.P., Schamir, A.: An Optimal Sorting Algorithm for Mesh Connected Computers. In: Prooceedings of the 18th Symposium on Theory of Computing (STOC 1986), pp. 255–263 (1986)
Seitz, C.L.: Mosaic C: An Experimental, Fine-Grain Multicomputer. In: Bensoussan, A., Verjus, J.-P. (eds.) INRIA 1992. LNCS, vol. 653, pp. 69–85. Springer, Heidelberg (1992)
Smith, B.J.: Architecture and Applications of the HEP multiprocessor computer. Soc. Photocopti. Instrum. Eng. 298, 241–248
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Osterloh, A. (2008). Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus. In: Agrawal, M., Du, D., Duan, Z., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2008. Lecture Notes in Computer Science, vol 4978. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79228-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-79228-4_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79227-7
Online ISBN: 978-3-540-79228-4
eBook Packages: Computer ScienceComputer Science (R0)