A preliminary architecture for a basic data-flow processor
ISCA '75 Proceedings of the 2nd annual symposium on Computer architecture
Experimental Polyprocessor System (EPOS)—architecture
ISCA '79 Proceedings of the 6th annual symposium on Computer architecture
Efficient message routing in Mega-Micro-Computer networks
ISCA '76 Proceedings of the 3rd annual symposium on Computer architecture
On Optimizing Diameter and Average Distance of Directed Interconnected Networks
IEEE Transactions on Computers
Uniform theory of the shuffle-exchange type permutation networks
ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture
Torus and Other Networks as Communication Networks With Up to Some Hundred Points
IEEE Transactions on Computers
| Hi-index | 0.01 |
This paper proposes the optimal processor interconnection topologies for parallel processing. The topologies are optimal with respect to the performance/cost ratio under the controlled message transfer delay and can be systematically constructed for an arbitrary number of processors. The addition and the deletion of processors are simple and done with the minimum number of bus reconnections. The message transfer delay, as well as the reliability, can be controlled by changing the degree of the topology. Owing to these properties, the optimal interconnection topologies are suitable for many kinds of parallel processing systems and algorithms.