Abstract
In this paper, we describe four families of topologies for interconnecting many identical processors into a computer network. Each family extends to arbitrarily many processors while keeping the number of neighbors of any one processor fixed. These families are investigated with respect to bus load, routing algorithms, and the relation between the average interprocessor distance and the size of the network.
Original language | English |
---|---|
Pages (from-to) | 360-371 |
Number of pages | 12 |
Journal | IEEE Transactions on Computers |
Volume | C-29 |
Issue number | 5 |
DOIs | |
State | Published - May 1980 |
Keywords
- Computer networks distributed computing
- message routing
- multiprocessor architectures
- network topology
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics