Abstract
High-radix multistage interconnection networks are popular interconnection technologies for parallel supercomputers and cluster computers. In this paper, we presented a new dynamically fault-tolerant high-radix multistage interconnection network using a fully-adaptive self-routing. To devise the fully-adaptive self-routing for recovering the misrouting around link faults in such network, we introduce an abstract algebraic analysis of the topological structure of the high-radix Delta network. The presented interconnection network provides multiple paths by using all the links of all the stages of the network. We also present a mathematical analysis of the reliability of the interconnection network for quantitative comparison against other networks. The MTTF of 64×64 network proposed is 2.2 times greater than that of the cyclic Banyan network. The hardware cost of the proposed network is half that of the cyclic Banyan network and the 2D ring-Banyan network.
Similar content being viewed by others
References
Kim J, Dally WJ, Abts D (2007) Flattened butterfly: a cost-efficient topology for high-radix networks. In: Proceedings of the 34th annual international symposium on computer architecture (ISCA ’07), 2007, pp 126–137
Eberle H, Garcia PJ, Flich J, Duato J, Drost R, Gura N, Hopkins D, Olesinski W (2008) High-radix crossbar switches enabled by proximity communication. In: Proceedings of the 2008 ACM/IEEE conference on supercomputing (SC ’08), conference on high performance networking and computing, 2008, pp 1–12
Duato J, Johnson I, Flich J, Naven F, Garcia P, Nachiondo T (2005) A new scalable and cost-effective congestion management strategy for lossless multistage interconnection networks. In: Proceedings of 11th international symposium on high-performance computer architecture (HPCA’05), 2005, pp 108–119
Mora G, Flich J, Duato J, López P, Baydal E, Lysne O (2006) Towards an efficient switch architecture for high-radix switches. In: Proceedings of the 2006 ACM/IEEE symposium on architecture for networking and communications systems (ANCS ’06), 2006, pp 11–20
Kim J, Dally WJ, Dally J, Abts D (2006) Adaptive routing in high-radix Clos network. In: Proceedings of ACM/IEEE SC 2006 conference (SC’06), 2006, p 7
Sem-Jacobsen FO, Skeie T, Lysne O, Torudbakken O, Rongved E, Johnsen B (2005) Siamese-twin: a dynamically fault-tolerant Fat-tree. In: Proceedings of 19th IEEE international parallel and distributed processing symposium (IPDPS’05), 2005, pp 100b
Abts D (2006) Challenges for future interconnection networks. In: Proceedings of the 14th annual IEEE symposium on high-performance interconnects (Hoti14), 2006. Panel discussion; http://www.hoti.org/hoti14/program/panel2slides/Abts-HotI2006-panel.pdf
Hui SK, Seman K, Yunus J (2002) An augmented chained fault-tolerant ATM switch. In: Proceedings of the 5th IEEE international conference on high speed networks and multimedia communications, 2002, pp 397–400
Tzeng N, Yew P, Zhu C (1988) Realizing fault-tolerant interconnection networks via chaining. IEEE Trans Comput 37:458–462
Park J-H, Yoon H, Lee H (1995) The cyclic Banyan network: A fault-tolerant multistage interconnection network with fully adaptive self-routing. In: Proceedings of the 7th IEEE symposium on parallel and distributed processing, 1995, pp 702–710
Park J-H, Yoon H, Lee H (1999) The deflection self-routing Banyan network: A large-scale ATM switch using fully adaptive self-routing and its performance analyses. IEEE ACM Trans Netw 7:588–604
Park J-H, Lee H-K (2006) Algebraic analysis of the topological properties of a Banyan network and its application in fault-tolerant switching networks. J Parallel Distrib Comput 66(6):773–779
Anan M, Guizani M (2000) A fault-tolerant ATM switching architecture. In: Proceedings of IEEE IPCCC ’00, 2000, pp 295–301
Arabnia HR, Oliver MA (1987) Arbitrary rotation of raster images with SIMD machine architectures. Int J Eurograph Assoc (Comput Graph Forum) 6:3–12
Bhandarkar SM, Arabnia HR, Smith JW (1995) A reconfigurable architecture for image processing and computer vision. Int J Pattern Recogn Artif Intell (IJPRAI) (special issue on VLSI Algorithms and Architectures for Computer Vision, Image Processing, Pattern Recognition and AI) 9:201–229
Bhandarkar SM, Arabnia HR (1995) The Hough transform on a reconfigurable multi-ring network. J Parallel Distrib Comput 24:107–114
Park J-H (2006) Two-dimensional ring-Banyan network: a high-performance fault-tolerant switching network. IET Electron Lett 42:249–251
Sem-Jacobsen FO, Lysne O, Skeie T (2006) Combining source routing and dynamic fault tolerance. In: Proceedings of 18th international symposium on computer architecture and high performance computing (SBAC-PAD’06), 2006, pp 151–158
Wu C, Feng T (1980) On a class of multistage interconnection networks. IEEE Trans Comput C-29:694–702
Adams III GB, Siegel HJ (1984) Modifications to improve the fault tolerance of the extra stage cube interconnection network. In: Proceedings of the 1984 international conference on parallel processing, 1984, pp 169–173
Padmanabhan K (1984) Fault tolerance and performance improvement in multiprocessor interconnection networks, Ph.D. Thesis, University of Illinois at Urbana-Champaign, Department of Computer Science, Report No. UIUCDCS-R-84-1156
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Park, JH. The deflection self-routing Delta network: a dynamically fault-tolerant high-radix multistage interconnection network. J Supercomput 55, 432–447 (2011). https://doi.org/10.1007/s11227-009-0337-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-009-0337-y