✦ LIBER ✦

On the design of hypermesh interconnection networks for multicomputers

✍ Scribed by M. Ould-Khaoua; L.M. Mackenzie

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 522 KB
Volume: 46
Category: Article
ISSN: 1383-7621
DOI: 10.1016/s1383-7621(99)00031-4

No coin nor oath required. For personal study only.

✦ Synopsis

Topology, routing algorithm, and router structure are among the most important factors that greatly in¯uence network performance. This paper assesses the interaction of these elements on two related but distinct types of multicomputer networks, the binary n-cube (or cube) and the hypermesh. The analysis will show that the topological properties of the hypermesh confer an important advantage over the cube that makes the former a promising option for use in high-performance multicomputers. The hypermesh can use simple routing algorithms and cheap routers with little performance penalty. The cube, on the other hand, is constrained to the use of a speci®c routing algorithm and complex routers to take advantage of its rich connectivity.

📜 SIMILAR VOLUMES

On the relative performance merits of hy

On the relative performance merits of hypercube and hypermesh networks

✍ S. Loucif; M. Ould-Khaoua 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 216 KB

Topology and routing algorithm are among the most important factors that greatly in¯uence network performance. This paper assesses the interaction of these factors on two related but distinct types of multicomputer networks, the hypercube and hypermesh. This study shows that the routing algorithm ca

Modeling of optical devices for the desi

Modeling of optical devices for the design of multistage interconnection network systems

✍ Guizani, Mohsen 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 907 KB

A Genetic Algorithm for Finding the Page

A Genetic Algorithm for Finding the Pagenumber of Interconnection Networks

✍ Nidhi Kapoor; Mark Russell; Ivan Stojmenovic; Albert Y. Zomaya 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 151 KB

A ''book-embedding'' of a graph G comprises embedding the graph's nodes along the spine of a book and embedding the edges on the pages so that the edges embedded on the same page do not intersect. This is also referred to as the page model. The ''pagenumber'' of a graph is the thickness of the small

On Some Properties and Algorithms for th

On Some Properties and Algorithms for the Star and Pancake Interconnection Networks

✍ Q. Ke; S.G. Akl; H. Meijer 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 909 KB

Migration of Tasks in Interconnection Ne

Migration of Tasks in Interconnection Networks Based on the Star Graph

✍ S. Latifi 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 603 KB

The hierarchy of the star graph allows the assignment of its special subgraphs (substars), which have the same topological features as the original graph, to a sequence of incoming tasks. The procedure for task allocation in the star graph can be done using the star code and the allocation tree cons

A new class of interconnection networks

A new class of interconnection networks based on the alternating group

✍ Jung-Sing Jwo; S. Lakshmivarahan; S. K. Dhall 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 724 KB

This paper introduces a new class of interconnection scheme based on the Cayley graph of the alternating group. It is shown that this class of graphs are edge symmetric and 2-transitive. We then describe an algorithm for (a) packet routing based on the shortest path analysis, (b) finding a Hamiltoni