Comparing the Performance Parameters of Two Network Structures for Scalable Massively Parallel Processors

  • Authors:
  • Ding-Ming Kwai;Behrooz Parhami

  • Affiliations:
  • -;-

  • Venue:
  • MASCOTS '96 Proceedings of the 4th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

Packed exponential connection (PEC) networks and periodically regular chordal (PRC) rings, proposed as enhanced versions of linear arrays and rings respectively, introduce a number of skip links into the respective networks. These networks can be viewed as derivatives of symmetric chordal rings with restricted and reduced connection assignments. Thus, an interesting question arises: How can one prune or thin the connections of a given network to a prescribed degree such that the key network properties are still acceptable? In this paper, we show the hierarchical arrangements and grouping strategies on which the PEC networks and PRC rings are based and examine their effects on expandability, ease of implementation, network diameter, and routing schemes.