Abstract
Clos- or fat-tree-based interconnection networks are widely used in data center and supercomputer designs. Both Clos and fat-tree are non-blocking multistage switch networks. The non-blocking property improves path diversity but meanwhile increases both hardware cost and packet latency. Some applications may not require non-blocking routing but prefer low packet latency. To cope with it, this paper proposes a peer k-ary n-tree or peer fat-tree network that takes the factors of path diversity, hardware cost, and packet latency into consideration. A peer k-ary n-tree network connects compute nodes with about half as many switches and links compared to Clos and fat-tree networks. It has two groups of compute nodes and provides short routing paths between the nodes in distinct groups and non-blocking routing between the nodes in the same group. We describe the peer k-ary n-tree network structure, investigate the topological properties, give a minimal per-hop deterministic routing algorithm, and evaluate the fault tolerance and packet latency of the peer k-ary n-tree network and compare the performance to that of Clos and fat-tree networks.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
A bidirectional link consists of a unidirectional input link and a unidirectional output link.
References
Abts, D., Kim, J.: High Performance Datacenter Networks: Architectures, Algorithms, and Opportunities. Morgan and Claypool, San Rafael, March 2011
Al-Fares, M., Loukissas, A., Vahdat, A.: A scalable, commodity data center network architecture. In: Proceedings of the ACM SIGCOMM 2008 Conference on Data Communication, pp. 63–74. Seattle, WA, USA, August 2008
Clos, C.: A study of non-blocking switching networks. Bell Syst. Tech. J. 32(2), 406–424 (1953)
Dally, W., Towles, B.: Principles and Practices of Interconnection Networks. Morgan Kaufmann, Burlington (2003)
Leiserson, C.E.: Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Trans. Comput. C-34(10), 892–901 (1985)
Li, Y., Chu, W.: MiKANT: a mirrored k-ary n-tree for reducing hardware cost and packet latency of fat-tree and clos networks. In: Proceedings of the 18th IEEE International Conference on Scalable Computing and Communications, pp. 1643–1650, October 2018
Li, Y., Chu, W.: Switch fault tolerance in a mirrored k-ary n-tree. In: Proceedings of the 2019 International Conference on Computer, Information and Telecommunication Systems, pp. 25–29, August 2019
Petrini, F., Vanneschi, M.: K-ary n-trees: high performance networks for massively parallel architectures. In: Proceedings of the 11th International Parallel Processing Symposium, pp. 87–93, April 1997
Singh, A., et al.: Jupiter rising: a decade of clos topologies and centralized control in Google’s datacenter network. In: 2015 ACM Conference on Special Interest Group on Data Communication, pp. 183–197, August 2015
TOP500: Supercomputer Sites, June 2022. http://top500.org/
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Li, Y., Chu, W. (2023). Fault Tolerance and Packet Latency of Peer Fat-Trees. In: Takizawa, H., Shen, H., Hanawa, T., Hyuk Park, J., Tian, H., Egawa, R. (eds) Parallel and Distributed Computing, Applications and Technologies. PDCAT 2022. Lecture Notes in Computer Science, vol 13798. Springer, Cham. https://doi.org/10.1007/978-3-031-29927-8_32
Download citation
DOI: https://doi.org/10.1007/978-3-031-29927-8_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-29926-1
Online ISBN: 978-3-031-29927-8
eBook Packages: Computer ScienceComputer Science (R0)