Comparing the performance parameters of two network structures for scalable massively parallel processors

Packed exponential connection (PEC) networks and periodically regular chordal (PRC) rings, proposed as enhanced versions of linear arrays and rings respectively introduce skip links into the respective base networks. Both networks can be viewed as derivatives of symmetric chordal rings with restricted or 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? We show the hierarchical arrangements and grouping strategies on which PEC networks and PRC rings are based and examine their effects on expandability, ease of implementation, network diameter, and routing schemes