✦ LIBER ✦

Communication algorithms in k-ary n-cube interconnection networks

✍ Scribed by Yaagoub Ashir; Iain A. Stewart; Aqeel Ahmed

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 589 KB
Volume: 61
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(96)00188-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A performance model of compressionless r

A performance model of compressionless routing in k-ary n-cube networks

✍ A. Khonsari; M. Ould-Khaoua 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 408 KB

Optimal parameters for load balancing us

Optimal parameters for load balancing using the diffusion method in k-ary n-cube networks

✍ C.-Z. Xu; F.C.M. Lau 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 538 KB

Fault-tolerant parallel k selection algo

Fault-tolerant parallel k selection algorithm in n-cube networks

✍ Jang-Ping Sheu 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 621 KB

Performance evaluation of deterministic

Performance evaluation of deterministic wormhole routing in k-ary n-cubes

✍ B. Ciciani; M. Colajanni; C. Paolucci 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 395 KB

We present a new analytical approach for the performance evaluation of deterministic wormhole routing in k-ary n-cubes. Our methodology achieves closed formulas for average time values through the analysis of network ¯ows. The comparison with simulation models demonstrates that our methodology gives

Data Rearrangement between Radix-k and L

Data Rearrangement between Radix-k and Lee Distance Gray Codes in k-ary n-cubes

✍ Myung M. Bae; R. Venkatesan; Bella Bose 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 150 KB

The k-ary n-cube is one of the popular topologies for interconnecting processors in multicomputers. This paper studies the difference in communication requirements between two Lee distance Gray codes when moving data from processors in normal radix k order to those in Gray code order in k-ary n-cube

Analytical modelling of wormhole-routed

Analytical modelling of wormhole-routed k-ary n-cubes in the presence of matrix-transpose traffic

✍ H. Sarbazi-Azad; M. Ould-Khaoua; L.M. Mackenzie 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 382 KB

Several analytical models of fully adaptive routing in wormhole-routed k-ary n-cubes under the uniform traffic pattern have recently been proposed in the literature. Although the uniform reference model has been widely used in the past, it is not always true in practice as there are many application