Umessage transfer algorithms an the recursive diagonal torus

Yulu Yang, Hideharu Amano

研究成果: Article

8 引用 (Scopus)

抜粋

Recursive Diagonal Torus (RDT) is a class of interconnection network for massively parallel computers with 216 nodes. In this paper, message transfer algorithms on the RDT are proposed and discussed. First, a simple one-to-one message routing algorithm called the vector routing is introduced and its practical extension called the floating vector routing is proposed. In the floating vector routing both the diameter and average distance are improved compared with the fixed vector routing. Next, broadcasting and hypercube emulation algorithm scheme on the RDT are shown. Finally, deadlock-free message routing algorithms on the RDT are discussed. By a simple modification of the e-cube routing and a small numbers of additional virtual channels, both one-to-one message transfer and broadcast can be achieved without deadlock.

元の言語English
ページ(範囲)107-116
ページ数10
ジャーナルIEICE Transactions on Information and Systems
E79-D
発行部数2
出版物ステータスPublished - 1996 1 1

    フィンガープリント

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

これを引用