Title :
Processor Interconnection Strategies
Author :
Finkel, Raphael A. ; Solomon, Marvin H.
Author_Institution :
Department of Computer Sciences, University of Wisconsin
fDate :
5/1/1980 12:00:00 AM
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.
Keywords :
Computer networks distributed computing; message routing; multiprocessor architectures; network topology; Algorithm design and analysis; Combinatorial mathematics; Computer architecture; Computer networks; Distributed computing; Joining processes; Network topology; Pattern analysis; Routing; Switches; Computer networks distributed computing; message routing; multiprocessor architectures; network topology;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1980.1675586
