By Topic

Recursive Diagonal Torus: an interconnection network for massively parallel computers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yulu Yang ; Dept. of Comput. Sci., Keio Univ., Yokohama, Japan ; Amano, H. ; Shibamura, H. ; Sueyoshi, T.

Recursive Diagonal Torus (RDT), a class of interconnection network is proposed for massively parallel computers with up to 216 nodes. By adding remote links to the diagonal directions of the torus network recursively, the RDT can realize a smaller diameter (e.g., it is 11 for 216 nodes) with smaller number of links per node (i.e., 8 links per node) than that of the hypercube. A simple routing algorithm called vector routing, which is near-optima and easy to implement is also proposed. The RDT comprises the mesh structure, and emulates hypercube and tree structures easily. FFT and the bitonic sorting algorithm are also easy to implement

Published in:

Parallel and Distributed Processing, 1993. Proceedings of the Fifth IEEE Symposium on

Date of Conference:

1-4 Dec 1993