This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
January 1983 (vol. 32 no. 1)
pp. 83-95
D.A. Reed, Department of Computer Sciences, Purdue University
Several interconnection structures for a distributed multimicrocomputer message-passing system are compared on the basis of cost and performance. Among the structures analyzed are buses, double rings, D-dimensional toroids, trees, cube-connected cycles, and chordal rings. Network cost is defined in terms of the number of network nodes and the unit cost of communication links and their associated connections. Simple asymptotic performance bounds are derived based on the bottleneck analysis of a queueing network. In contrast to the usual assumption of uniform message routing, the technique permits the introduction of a reference locality notion to the message routing behavior of network nodes. Finally, the cost, performance, and performance/cost functions are examined as the number of network nodes becomes very large.
Index Terms:
perpormance analysis, Interconnection networks, large multicomputer, systems, message routing, message traffic, network computers
Citation:
D.A. Reed, H.D. Schwetman, "Cost-Performance Bounds for Multimicrocomputer Networks," IEEE Transactions on Computers, vol. 32, no. 1, pp. 83-95, Jan. 1983, doi:10.1109/TC.1983.1676126
Usage of this product signifies your acceptance of the Terms of Use.