Performance model of a multiprocessor interconnection network: theory and simulation

Authors:
Yelena Rykalova;Lev B. Levitin;Richard Brower
Affiliations:
Boston University, Boston, MA;Boston University, Boston, MA;Boston University, Boston, MA
Venue:
SpringSim '07 Proceedings of the 2007 spring simulaiton multiconference - Volume 1
Year:
2007

Citing 8
Cited 3

Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)
A Generalized Queueing Discipline for Product Form Network Solutions

Journal of the ACM (JACM)
Mean-Value Analysis of Closed Multichain Queuing Networks

Journal of the ACM (JACM)
A Characterization of Product-Form Queuing Networks

Journal of the ACM (JACM)
Computational algorithms for closed queueing networks with exponential servers

Communications of the ACM
Mean Value Analysis fo Queueing Networks - A New Look at an Old Problem

Proceedings of the Third International Symposium on Modelling and Performance Evaluation of Computer Systems: Performance of Computer Systems
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems
Queuing Networks with Random Selection for Service

IEEE Transactions on Software Engineering

Interconnection networks with heterogeneous activity or finite buffers: beyond Jackson's theorem

Proceedings of the 11th communications and networking simulation symposium
Multiprocessor networks with small buffers: theory and simulation

SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Latency and saturation in networks with finite buffers

Proceedings of the 14th Communications and Networking Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present theoretical and numerical results for performance of a multiprocessor network modeled as a ring and as a 2-dim wrapped around square lattice of nodes with local processors that generate messages with rate λ per clock cycle and two or, respectively, four output ports/buffers. Output buffers assumed to have infinite capacity and service time is deterministic. Explicit expressions for the distribution of queue length, the average number of messages in buffers, the average latency and the critical network load depending on distance between the source and the destination are obtained. Simulation results show an excellent agreement with theoretical predictions based on the assumption of independent queues.