Message Transfer Algorithms on the Recursive Diagonal Torus

Yulu YANG; Hideharu AMANO

Message Transfer Algorithms on the Recursive Diagonal Torus

Yulu YANG, Hideharu AMANO

Full Text Views

0

Share
Cite this

Summary :

Recursive Diagonal Torus (RDT) is a class of interconnection network for massively parallel computers with 2¹⁶ 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.

Publication: IEICE TRANSACTIONS on Information Vol.E79-D No.2 pp.107-116

Publication Date: 1996/02/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Computer Systems

Cite this

Copy

Yulu YANG, Hideharu AMANO, "Message Transfer Algorithms on the Recursive Diagonal Torus" in IEICE TRANSACTIONS on Information, vol. E79-D, no. 2, pp. 107-116, February 1996, doi: .
Abstract: Recursive Diagonal Torus (RDT) is a class of interconnection network for massively parallel computers with 2¹⁶ 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.
URL: https://globals.ieice.org/en_transactions/information/10.1587/e79-d_2_107/_p

Copy

@ARTICLE{e79-d_2_107,
author={Yulu YANG, Hideharu AMANO, },
journal={IEICE TRANSACTIONS on Information},
title={Message Transfer Algorithms on the Recursive Diagonal Torus},
year={1996},
volume={E79-D},
number={2},
pages={107-116},
abstract={Recursive Diagonal Torus (RDT) is a class of interconnection network for massively parallel computers with 2¹⁶ 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={},
doi={},
ISSN={},
month={February},}

Copy

TY - JOUR
TI - Message Transfer Algorithms on the Recursive Diagonal Torus
T2 - IEICE TRANSACTIONS on Information
SP - 107
EP - 116
AU - Yulu YANG
AU - Hideharu AMANO
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E79-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 1996
AB - Recursive Diagonal Torus (RDT) is a class of interconnection network for massively parallel computers with 2¹⁶ 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.
ER -