A tight bound on the diameter of one dimensional PEC networks

The diameter of a packed exponential connections (PEC) network on N nodes is shown to be theta ( square root log N*2 square root /sup (2log/ /sup N)/, where log N denotes log to the base 2. The present results can be extended to the case of two-dimensional PEC networks.<<ETX>>

[1]  Quentin F. Stout,et al.  Mesh-Connected Computers with Broadcasting , 1983, IEEE Transactions on Computers.

[2]  C.-C. Lin,et al.  A routing algorithm for PEC networks , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.

[3]  J. P. Gray,et al.  Configurable hardware: a new paradigm for computation , 1989 .

[4]  W. Worth Kirkman,et al.  Packed exponential connections-a hierarchy of 2-D meshes , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.

[5]  W. W. Kirkman.  The Digital Transform Machine , 1990, [1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation.

[6]  David A. Carlson.  Performing Tree and Prefix Computations on Modified Mesh-Connected Parallel Computers , 1985, ICPP.