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

Fingerprint

Routing algorithms
Broadcasting

Keywords

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

ASJC Scopus subject areas

  • Information Systems
  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

Umessage transfer algorithms an the recursive diagonal torus. / Yang, Yulu; Amano, Hideharu.

In: IEICE Transactions on Information and Systems, Vol. E79-D, No. 2, 1996, p. 107-116.

Research output: Contribution to journalArticle

@article{2aa9170e4cad4a83b40543be4f2a99fe,
title = "Umessage transfer algorithms an the recursive diagonal torus",
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.",
keywords = "Broadcast, Deadlock-free, Interconnection network, Routing algorithm",
author = "Yulu Yang and Hideharu Amano",
year = "1996",
language = "English",
volume = "E79-D",
pages = "107--116",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "2",

}

TY - JOUR

T1 - Umessage transfer algorithms an the recursive diagonal torus

AU - Yang, Yulu

AU - Amano, Hideharu

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

KW - Broadcast

KW - Deadlock-free

KW - Interconnection network

KW - Routing algorithm

UR - http://www.scopus.com/inward/record.url?scp=0030081697&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030081697&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0030081697

VL - E79-D

SP - 107

EP - 116

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 2

ER -