The Operational Analysis of Queueing Network Models
ACM Computing Surveys (CSUR)
Balanced job bound analysis of queueing networks
Communications of the ACM
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Communications of the ACM
Communicating sequential processes
Communications of the ACM
Efficient message routing in Mega-Micro-Computer networks
ISCA '76 Proceedings of the 3rd annual symposium on Computer architecture
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
A large scale, homogeneous, fully distributed parallel machine, I
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Communication Structures for Large Networks of Microcomputers
IEEE Transactions on Computers
Processor Interconnection Strategies
IEEE Transactions on Computers
A Shuffle-Exchange Network with Simplified Control
IEEE Transactions on Computers
Stencils and problem partitionings: their influence on the performance of multiple processor systems
IEEE Transactions on Computers
Traffic-Specific Interconnection Networks for Multicomputers
IEEE Transactions on Computers
Hypernet: A communication-efficient architecture for constructing massively parallel computers
IEEE Transactions on Computers
The Performance of Multimicrocomputer Networks Supporting Dynamic Workloads
IEEE Transactions on Computers
| Hi-index | 14.99 |
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.