Title :
Torus and Other Networks as Communication Networks With Up to Some Hundred Points
Author :
Von Conta, Christoph
Author_Institution :
Institut fur Informatik, Technische Universitat Munchen
fDate :
7/1/1983 12:00:00 AM
Abstract :
To be used as message passing networks of computers we consider graphs of degree D and diameter K. To obtain bounds for the average distance Ak (and K) with any given number N of nodes and given D we generalize Moore graphs to Moore* graphs minimizing Ak.
Keywords :
Dense (d, k) graphs; Torus networks; distributed processing; message passing networks; network architectures; regular networks; Added delay; Communication networks; Computer networks; Concurrent computing; Delay effects; Distributed processing; Hardware; Integrated circuit technology; Message passing; Pins; Dense (d, k) graphs; Torus networks; distributed processing; message passing networks; network architectures; regular networks;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1983.1676297
