Abstract
A graph-theoretic definition is proposed to make precise the sense in which a “fat-tree” is a tree-like interconnection of subnetworks whose bandwidth is adequately described by the capacity of the channels between subnetworks. The definition is shown to encompass a number of known networks such as the concentrator fat-tree, the pruned butterfly, and the tree-of-meshes. In the established framework, a non-trivial Ω(N log 2 N) lower bound is derived for the area of a class of fat-trees, with implications for their area-universality.
The research of the first author was supported in part by the ESPRIT Basic Research Project 9072 GEPPCOM: Foundations of GEneralPurpose Parallel COMputing, by the Italian National Research Council, and by the Italian Ministry of University and Research.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
P. Bay. Area-Universal Interconnection Networks for VLSI Parallel Computers. Ph.D. dissertation, Cornell University, May 1992.
P. Bay and G. Bilardi. Deterministic on-line routing on area-universal networks. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pages 297–306, October 1990.
P. Bay and G. Bilardi. An area-universal VLSI circuit. In Proceedings of the 1993 Symposium on Integrated Systems, pages 53–67, March 1993.
G. Bilardi, S. Chauduri, D. Dubashi, and K. Mehlhorn. A lower bound for area-universal graphs. Technical Report MPI-I-93-144, Max-Plank-Institut fur Informatik, October 1993.
S. N. Bhatt and F. T. Leighton. A framework for solving VLSI graph layout problems. Journal of Computer and System Sciences, 28(2):300–343, 1984.
R. I. Greenberg and C. E. Leiserson. Randomized routing on fat-trees. In S. Micali, editor, Randomness and Computation, pages 345–374. JAI Press, Inc., 1989.
R. I. Greenberg. The fat-pyramid: A robust network for parallel computation. In W. J. Dally, editor, Advanced Research in VLSI: Proceedings of the Sixth MIT Conference, pages 195–213, 1990.
F. Harary. Graph Theory. Addison-Wesley, Reading, MA, 1969.
C. E. Leiserson, Z. S. Abuhamdeh, D. C. Douglas, C. R. Feynman, M. N. Ganmukhi, J. V. Hill, W. D. Hillis, B. C. Kuszmaul, M. A. St. Pierre, D. S. Wells, M. C. Wong, S.-W. Yang, and R. Zak. The network architecture of the Connection Machine CM-5. In Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 272–285, July 1992.
F. T. Leighton. New lower bound techniques for VLSI. Mathematical Systems Theory, 17:47–70, 1984.
C. E. Leiserson. Fat-trees: Universal networks for hardware-efficient supercomputing. IEEE Transactions on Computers, C-34(10):892–900, October 1985.
T. Leighton, B. Maggs, and S. Rao. Universal packet routing algorithms. In Proceedings of the 29th Annual Symposium on the Foundations of Computer Science, White Plains, New York, October 1988.
R. E. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.
C. D. Thompson. A Complexity Theory for VLSI. Ph.D. dissertation, Carnegie-Mellon University, August 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bilardi, G., Bay, P. (1994). An area lower bound for a class of fat-trees. In: van Leeuwen, J. (eds) Algorithms — ESA '94. ESA 1994. Lecture Notes in Computer Science, vol 855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049427
Download citation
DOI: https://doi.org/10.1007/BFb0049427
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58434-6
Online ISBN: 978-3-540-48794-4
eBook Packages: Springer Book Archive