An analytic model of multistage interconnection networks

  • Authors:
  • Darryl L. Willick;D. L. Eager

  • Affiliations:
  • Department of Computational Science, University of Saskatchewan;Department of Computational Science, University of Saskatchewan

  • Venue:
  • SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multiprocessors require an interconnection network to connect processors with memory modules. The performance of the interconnection network can have a large effect upon overall system performance, and, therefore, methods are needed to model and compare alternative network architectures.This paper is concerned with evaluating the performance of multistage interconnection networks consisting of k × s switching elements. Examples of such networks include omega, binary n-cube and baseline networks. We consider clocked, packet switched networks with buffers at switch output ports. An analytical model based on approximate Mean Value Analysis is developed, then validated through simulations.