Routing Deadlock Problem in Certain Orthogonal Switches and Its Solvent

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

High-radix interconnection networks are one of the current hot spots in studying high-performance interconnection networks, and the switch fabric based on the orthogonal backplane (referred to as orthogonal switch) is an important technical way to realize the high-density packaging of high-radix interconnection networks. The work described the structure of a orthogonal switch (SW-384) and analyzed the routing loops and deadlock problems occurring in this orthogonal switch. A deadlock-free load-balancing routing algorithm was proposed, with the advantages, disadvantages, and improved methods of the routing algorithm discussed. The proposed routing algorithm has been practically applied to an interconnection network of the Tianhe high-performance computing system, which avoided routing deadlocks and made the static load relatively balanced. The research results are of reference significance for designing deadlock-free load-balanced routing algorithms using orthogonal switches with similar structures.

Cite

CITATION STYLE

APA

Cao, J., Qi, X., & Wang, Q. (2022). Routing Deadlock Problem in Certain Orthogonal Switches and Its Solvent. In Lecture Notes in Electrical Engineering (Vol. 961 LNEE, pp. 1442–1453). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-981-19-6901-0_152

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free