Abstract
A new class of incrementally expandable interconnection networks with high connectivity and low diameter is introduced in this paper for massively parallel and distributed processing. This class of networks can be constructed for any number of computing nodes and the network size can easily be incremented without undergoing a major reconfiguration of the network. The connectivity and the diameter of the network are logarithmic orders of the number of nodes. It has been shown that the connectivity of the network is equal to the minimum node degree. In this sense the connectivity is optimal. The routing algorithms for the network are simple to implement.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 338-344 |
| Number of pages | 7 |
| Journal | Journal of Parallel and Distributed Computing |
| Volume | 13 |
| Issue number | 3 |
| DOIs | |
| State | Published - Nov 1991 |
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications
- Artificial Intelligence