Abstract
We present a new bound for pure greedy hot potato routing on n ×n mesh-connected arrays and n ×n tori. For permutation problems the bound is \(O(n \sqrt{n} \log n)\) steps which improves the for a long time known bound of O(n 2). For the more general link-limited k-destination routing problem the bound is \(O(n \sqrt{kn} \log n)\). The bound also holds for restricted pure greedy hot potato routing on n ×n meshes with diagonals. The bound could be derived by a new technique where packets may have several identities.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baran, P.: On distributed communication networks. IEEE Trans. Commun. Syst. 12, 1–9 (1964)
Ben-Aroya, I., Eilam, T., Schuster, A.: Greedy hot-potato routing on the two-dimensional mesh. Distrib. Comput. 9, 3–19 (1995)
Borodin, A., Hopcroft, J.E.: Routing, merging, and sorting on parallel models of computation. J. Comput. Syst. Sci. 30, 130–145 (1985)
Ben-Dor, A., Halevi, S., Schuster, A.: Potential function analysis of greedy hot-potato routing. In: Symposium on Principles of Distributed Computing (PODC ’94), pp. 225–234. ACM Press, New York (1994)
Ben-Dor, A., Halevi, S., Schuster, A.: Potential function analysis of greedy hot-potato routing. Theory Comput. Syst. 31, 41–61 (1998)
Busch, C., Herlihy, M., Wattenhofer, R.: Randomized greedy hot-potato routing. In: Proc. 11th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA’2000), San Francisco, CA, pp. 458–466. SIAM, Philadelphia (2000)
Busch, C., Herlihy, M., Wattenhofer, R.: Hard-potato routing. In: Proc. 32nd Ann. ACM Symp. on the Theory of Computing (STOC’2000), Portland, OR, pp. 278–285. ACM Press, New York (2000)
Borodin, A., Rabani, Y., Schieber, B.: Deterministic many-to-many hot potato routing. IEEE Trans. Parallel Distrib. Syst. 8, 587–596 (1997)
Feige, U., Raghavan, P.: Exact analysis of hot-potato routing. In: Proc. 33rd Ann. Symp. Foundations of Computer Science (FOCS’92), Pittsburgh, PA, pp. 553–562. IEEE Computer Society Press, Los Alamitos (1992)
Hillis, W.D.: The Connection Machine. MIT Press, Cambridge (1985)
Kaklamanis, C., Krizanc, D., Rao, S.: Hot-potato routing on processor arrays. In: Proc. 5th Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA’93), pp. 273–282. ACM Press, New York (1993)
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. 333–541. Springer, Heidelberg (1994)
Newman, I., Schuster, A.: Hot-potato algorithms for permutation routing. IEEE Trans. Parallel Distrib. Syst. 6, 1168–1176 (1995)
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 (1981)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Kunde, M. (2007). A New Bound for Pure Greedy Hot Potato Routing. In: Thomas, W., Weil, P. (eds) STACS 2007. STACS 2007. Lecture Notes in Computer Science, vol 4393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70918-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-70918-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70917-6
Online ISBN: 978-3-540-70918-3
eBook Packages: Computer ScienceComputer Science (R0)