✦ LIBER ✦

Parallel routing algorithms in Benes-Clos networks

✍ Scribed by Lee, T.T.; Liew, S.Y.

Book ID: 114608545
Publisher: IEEE
Year: 2002
Tongue: English
Weight: 473 KB
Volume: 50
Category: Article
ISSN: 0090-6778
DOI: 10.1109/tcomm.2002.805258

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Randomized self-routing algorithms for C

Randomized self-routing algorithms for Clos networks

✍ Abdou Youssef 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 747 KB

Parallel algorithms for routing in nonbl

Parallel algorithms for routing in nonblocking networks

✍ Geng Lin; Nicholas Pippenger 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 786 KB

Fault identification and routing in Bene

Fault identification and routing in Benes networks

✍ Nabanita Das; Jayasree Dattagupta 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 944 KB

An N × N Benes network B(n) (n = log 2 N), being a rearrangeable network, can realize any N × N permutation in a single pass. But even in the presence of a single switch fault in B(n), two passes are necessary to realize any N×N permutation. In this paper, we attempt to characterize the switch fault

Applications of matching and edge-colori

Applications of matching and edge-coloring algorithms to routing in clos networks

✍ John D. Carpinelli; A. Yavuz Oruc 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 702 KB

Monotone Routing in Multirate Rearrangea

Monotone Routing in Multirate Rearrangeable Clos Networks

✍ Xiao-Dong Hu; Xiao-Hua Jia; Ding-Zhu Du; Frank K. Hwang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 116 KB

In this paper, we study monotone routing in the symmetric three-stage Clos network with general bandwidth, and propose a new approach to analyze the multirate rearrangeability. For networks with small size switches, we show that monotone routing is better than the previous methods. 2001

On evil-twin routing in Clos networks

✍ Zhen Chen; Zeng-Ji Liu; Zhi-Liang Qiu; Xiao-Ming Tao 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 142 KB