Umessage transfer algorithms an the recursive diagonal torus

Yulu Yang, Hideharu Amano

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)107-116
Number of pages10
JournalIEICE Transactions on Information and Systems
VolumeE79-D
Issue number2
Publication statusPublished - 1996 Jan 1

Keywords

  • Broadcast
  • Deadlock-free
  • Interconnection network
  • Routing algorithm

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Umessage transfer algorithms an the recursive diagonal torus'. Together they form a unique fingerprint.

  • Cite this