Abstract
In this work we consider deterministic oblivious dimensional routing algorithms on d-dimensional meshes. In oblivious dimensional routing algorithms the path of a packet depends only on the source and destination node of the packet. Furthermore packets use a shortest path with a minimal number of bends. We present an Ω(kn (d + 1)/2) step lower bound for oblivious dimensional k-k routing algorithms on d-dimensional meshes for odd d > 1 and show that the bound is tight.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Borodin, A., Hopcroft, J.E.: Routing, merging, and sorting on parallel models of computation. In: Proceedings of the 14th Annual ACM Symposium on the Theory of Computing, pp. 338–344 (1982)
Borodin, A., Raghavan, P., Schieber, B., Upfal, E.: How much can hardware help routing? In. In: Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, pp. 573–582 (1993)
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)
Iwama, K., Miyano, E.: A lower bound for elementary oblivious routing on three-dimensional meshes. Journal of Algorithms 39, 145–161 (2001)
Iwama, K., Miyano, E.: An O(\(\sqrt {N}\)) oblivious routing algorithm for 2-D meshes of constant queue-size. Journal of Algorithms 41, 262–279 (2001)
Kaklamanis, C., Krizanc, D., Tsantilas, T.: Tight bounds for oblivious routing in the hypercube. Mathematical Systems Theory 24(4), 223–232 (1991)
Krizanc, D.: Oblivious routing with limited buffer capacity. Journal of Computer and System Sciences 43(2), 317–327 (1991)
Krizanc, D., Peleg, D., Upfal, E.: A time-randomness tradeoff for oblivious routing. In: Proceedings of the 20th Annual ACM Symposium on the Theory of Computing, pp. 93–102 (1988)
Leighton, F.T.: Introduction to Parallel Algorithms and Architectures. Morgan Kaufman, San Mateo (1992)
Litman, A., Moran-Schein, S.: Fast, minimal, and oblivious routing algorithms on the mesh with bounded queues. Journal of Interconnection Networks 2(4), 445–469 (2001)
Meyer auf der Heide, F., Scheideler, C.: Communication in parallel systems. In: Král, J., Bartosek, M., Jeffery, K. (eds.) SOFSEM 1996. LNCS, vol. 1175, pp. 16–34. Springer, Heidelberg (1996)
Osterloh, A.: Oblivious routing on d-dimensional meshes. In: Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, pp. 305–320. Carleton Scientific (2001)
Osterloh, A.: Aspects of k-k routing in Meshes and OTIS Networks. Ph.d. thesis, Technical University of Ilmenau (2002)
Parberry, I.: An optimal time bound for oblivious routing. Algorithmica 5, 243–250 (1990)
Rajasekaran, S., Tsantilas, T.: Optimal routing algorithms for mesh-connected processor arrays. Algorithmica 8, 21–38 (1992)
Sibeyn, J.F., Kaufmann, M.: Deterministic 1-k routing on meshes. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 237–248. Springer, Heidelberg (1994)
Valiant, L.G.: A scheme for fast parallel communication. SIAM Journal on Computing 11(2), 350–361 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Osterloh, A. (2009). A Lower Bound for Oblivious Dimensional Routing. In: Sips, H., Epema, D., Lin, HX. (eds) Euro-Par 2009 Parallel Processing. Euro-Par 2009. Lecture Notes in Computer Science, vol 5704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03869-3_92
Download citation
DOI: https://doi.org/10.1007/978-3-642-03869-3_92
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03868-6
Online ISBN: 978-3-642-03869-3
eBook Packages: Computer ScienceComputer Science (R0)