Recursive diagonal torus: An interconnection network for massively parallel computers

Yulu Yang, Akira Funahashi, Akiya Jouraku, Hiroaki Nishi, Hideharu Amano, Toshinori Sueyoshi

研究成果: Article査読

55 被引用数 (Scopus)

抄録

Recursive Diagonal Torus (RDT), a class of interconnection network is proposed for massively parallel computers with up to 2 16 nodes. By making the best use of a recursively structured diagonal mesh (torus) connection, the RDT has a smaller diameter (e.g., it is 11 for 2 16 nodes) with a smaller number of links per node (i.e., 8 links per node) than those of the hypercube, A simple routing algorithm, called vector routing, which is near-optimal and easy to implement is also proposed. Although the congestion on upper rank tori sometimes degrades the performance under the random traffic, the RDT provides much better performance than that of a 2D/3D torus in most cases and, under hot spot traffic, the RDT provides much better performance than that of a 2D/3D/4D torus. The RDT router chip which provides a message multicast for maintaining cache consistency is available. Using the 0.5μm BiCMOS SOG technology, versatile functions, including hierarchical multicasting, combining acknowledge packets, shooting down/restart mechanism, and time-out/setup mechanisms, work at a 60MHz clock rate.

本文言語English
ページ(範囲)701-715
ページ数15
ジャーナルIEEE Transactions on Parallel and Distributed Systems
12
7
DOI
出版ステータスPublished - 2001 7 1

ASJC Scopus subject areas

  • 信号処理
  • ハードウェアとアーキテクチャ
  • 計算理論と計算数学

フィンガープリント

「Recursive diagonal torus: An interconnection network for massively parallel computers」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル