Abstract
This paper shows how to embed complete binary trees in products of complete binary trees, products of shuffle-exchange graphs, and products of de Bruijn graphs. The main emphasis of the embedding methods presented here is how to emulate arbitrarily large complete binary trees in these product graphs with low slowdown. For the embedding methods presented here the size of the host graph can be fixed to an arbitrary size, while we define no bound on the size of the guest graph. This is motivated by the fact that the host architecture has a fixed number of processors due to its physical design, while the guest graph can grow arbitrarily large depending on the application. The results of this paper widen the class of computations that can be performed on these product graphs which are often cited as being low-cost alternatives for hypercubes.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Efe, “Embedding Large Complete Binary Trees in Hypercubes with Load Balancing,” Journal of Parallel and Distributed Computing, vol. 35, no. 1, May 1996, pp. 104–109.
K. Efe and A. Fernández, “Mesh Connected Trees: A Bridge between Grids and Meshes of Trees,” IEEE Transactions on Parallel and Distributed Systems. To appear in 1996.
K. Efe and A. Fernández, “Products of Networks with Logarithmic Diameter and Fixed Degree,” IEEE Transactions on Parallel and Distributed Systems, vol. 6, pp. 963–975, Sept. 1995.
R. Feldmann and W. Unger, “The Cube-Connected Cycles Network is a Subgraph of the Butterfly Network,” Parallel Processing Letters, vol. 2, no. 1, pp. 13–19, 1992.
A. Fernández, Homogeneous Product Networks for Processor Interconnection. PhD thesis, U. of Southwestern Louisiana, Lafayette, LA, Oct. 1994.
J. P. Fishburn and R. A. Finkel, “Quotient Networks,” IEEE Transactions on Computers, vol. 31, pp. 288–295, Apr. 1982.
R. Koch, T. Leighton, B. Maggs, S. Rao, and A. L. Rosenberg, “Work-Preserving Emulations of Fixed-Connection Networks,” in Proceedings of the 21st Annual ACM Symposium on Theory of Computing, (Seattle), pp. 227–240, May 1989.
A. L. Rosenberg, “Product-Shuffle Networks: Toward Reconciling Shuffles and Butterflies,” Discrete Applied Mathematics, vol. 37/38, pp. 465–488, July 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Broadwater, A., Efe, K., Fernández, A. (1997). Embedding complete binary trees in product graphs. In: d'Amore, F., Franciosa, P.G., Marchetti-Spaccamela, A. (eds) Graph-Theoretic Concepts in Computer Science. WG 1996. Lecture Notes in Computer Science, vol 1197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62559-3_6
Download citation
DOI: https://doi.org/10.1007/3-540-62559-3_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62559-9
Online ISBN: 978-3-540-68072-7
eBook Packages: Springer Book Archive