Abstract
We examine on-line heap construction and on-line permutation routing on trees under the matching model. Let T be and n-node tree of maximum degree d. By providing on-line algorithms we prove that:
-
(1)
For a rooted tree of height h, on-line heap construction can be completed within (2d−1)h routing steps.
-
(2)
For an arbitrary tree, on-line permutation routing can be completed within 4dn routing steps.
-
(3)
For a complete d-ary tree, on-line permutation routing can be completed within 2(d−1)n+2dlog2 n routing steps.
Supported by an ARC Institutional Grant.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Akl. Parallel Sorting Algorithms. Academic Press, 1985.
Alon, Chung, and Graham. Routing permutations on graphs via matchings. SIAM Journal on Discrete Mathematics, 7:513–530, 1994.
N. Haberman. Parallel neighbor-sort (or the glory of the induction principle). Technical Report AD-759 248, National Technical Information Service, US Department of Commerce, 5285 Port Royal Road, Springfieldn VA 22151, 1972.
D. Krizanc and L. Zhang. Many-to-one packet routing via matchings. In Proceedings of the Third Annual International Computing and Combinatorics Conference, Shanghai, China, August 1997. To appear.
F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays — Trees — Hypercubes. Morgan Kaufmann, San Mateo, CA 94403, 1991.
G. Pantziou, A. Roberts, and A. Symvonis. Dynamic tree routing under the “matching with consumption” model. In T. Asano, Y. Igarashi, H. Nagamochi, S. Miyano, and S. Suri, editors, Proceedings of the 7th International Symposium on Algorithms and Computation ISAAC '96 (Osaka, Japan, December 1996), LNCS 1178, pages 275–284. Springer-Verlag, 1996.
G. Pantziou, A. Roberts, and A. Symvonis. Many-to-many routing on trees via matchings. Technical Report TR-507, Basser Dept of Computer Science, University of Sydney, July 1996. To appear in Theoretical Computer Science. Available from ftp://ftp.cs.su.oz.aU/pub/tr/TR96_507.ps.Z.
A. Roberts, and A. Symvonis. On Deflection Worm Routing on Meshes. Technical Report TR-514, Basser Dept of Computer Science, University of Sydney, May 1997. Available from ftp://ftp.cs.su.oz.au/pub/tr/TR97_514.ps.Z.
A. Roberts, A. Symvonis, and L. Zhang. Routing on trees via matchings. In Proceedings of the Fourth Workshop on Algorithms and Data Structures (WADS'95), Kingston, Ontario, Canada, pages 251–262. Springer-Verlag, LNCS 955, aug 1995. Also TR 494, January 1995, Basser Dept of Computer Science, University of Sydney. Available from ftp://ftp.cs.su.oz.au/pub/tr/TR95_494.ps.Z.
Louxin Zhang. Optimal bounds for matching routing on trees. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 445–453, New Orleans, Louisiana, 5–7 January 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roberts, A., Symvonis, A. (1998). On-Line matching routing on trees. In: Lucchesi, C.L., Moura, A.V. (eds) LATIN'98: Theoretical Informatics. LATIN 1998. Lecture Notes in Computer Science, vol 1380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054329
Download citation
DOI: https://doi.org/10.1007/BFb0054329
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64275-6
Online ISBN: 978-3-540-69715-2
eBook Packages: Springer Book Archive