Adaptive wormhole routing in k-ary n-cubes

C. S. Yang, Y. M. Tsai, S. L. Chi, Shepherd S.B. Shi

研究成果: Article同行評審

2 引文 斯高帕斯(Scopus)

摘要

Distributed memory multiprocessor (DMMP) systems have gained much attention because their performance can be easily scaled up by increasing the number of processor-memory modules. The k-ary n-cube is the most popular interconnection network topology currently used in DMMPs. Wormhole routing is one of the most promising switching technology and has been used in many new generation multicomputers. Wormhole routing makes the communication latency insensitive to the network diameter and reduces the size of the channel buffer of each router. The concept of virtual channels and virtual networks are widely invented for deadlock-free design. A fully adaptive wormhole routing method for k-ary n-cubes has been proposed by Linder in 1991 [10]. Unfortunately, the need of 2n - 1 virtual networks makes it unreasonable. In this paper, we propose a virtual network system to support an adaptive, minimal and deadlock free routing in k-ary n-cubes. It uses only four virtual networks but can get a higher degree of adaptability and higher traffic capacity. Simulation results are presented to verify the performance.

原文English
頁(從 - 到)1925-1943
頁數19
期刊Parallel Computing
21
發行號12
DOIs
出版狀態Published - 1995 12月

All Science Journal Classification (ASJC) codes

  • 軟體
  • 理論電腦科學
  • 硬體和架構
  • 電腦網路與通信
  • 電腦繪圖與電腦輔助設計
  • 人工智慧

指紋

深入研究「Adaptive wormhole routing in k-ary n-cubes」主題。共同形成了獨特的指紋。

引用此