Cost-Performance Bounds for Multimicrocomputer Networks
- 1 January 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-32 (1) , 83-95
- https://doi.org/10.1109/tc.1983.1676126
Abstract
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.Keywords
This publication has 12 references indexed in Scilit:
- Balanced job bound analysis of queueing networksCommunications of the ACM, 1982
- Communication Structures for Large Networks of MicrocomputersIEEE Transactions on Computers, 1981
- Analysis of Chordal Ring NetworkIEEE Transactions on Computers, 1981
- Processor Interconnection StrategiesIEEE Transactions on Computers, 1980
- The Operational Analysis of Queueing Network ModelsACM Computing Surveys, 1978
- Can programming be liberated from the von Neumann style?Communications of the ACM, 1978
- Communicating sequential processesCommunications of the ACM, 1978
- Distributed Loop Computer NetworksPublished by Elsevier ,1978
- A large scale, homogeneous, fully distributed parallel machine, IPublished by Association for Computing Machinery (ACM) ,1977
- Efficient message routing in Mega-Micro-Computer networksPublished by Association for Computing Machinery (ACM) ,1976