EMBEDDING MESHES AND TORUS NETWORKS ONTO DEGREE-4 CHORDAL RINGS

Citation
Jf. Fang et al., EMBEDDING MESHES AND TORUS NETWORKS ONTO DEGREE-4 CHORDAL RINGS, IEE proceedings. Computers and digital techniques, 145(2), 1998, pp. 73-80
Citations number
17
Categorie Soggetti
Computer Science Hardware & Architecture","Computer Science Theory & Methods","Computer Science Hardware & Architecture","Computer Science Theory & Methods
ISSN journal
13502387
Volume
145
Issue
2
Year of publication
1998
Pages
73 - 80
Database
ISI
SICI code
1350-2387(1998)145:2<73:EMATNO>2.0.ZU;2-S
Abstract
Degree-four chordal rings demonstrate many attractive properties, such as node symmetry, constant degree, O(root N) diameter and the ability to interconnect an arbitrary number of nodes. The authors study the a bilities of degree-four chordal rings to execute parallel programs usi ng graph-embedding techniques. Since many algorithms have been designe d for meshes and TORUS networks, the issue of embedding meshes and TOR US networks onto degree-four chordal rings is addressed. Mapping funct ions, simple and snake-like, of embedding meshes and TORUS networks on to the degree-four chordal rings is discussed in detail. It is shown t hat the ILLIAC network is a special class of the degree-four chordal r ing. Topological properties are investigated, such as diameter and ave rage distance of ILLIAC networks and optimal degree-four chordal rings , another special class of degree-four chordal rings. Comparisons of I LLIAC networks and optimal chordal rings in these embedding issues are given.