Performance of Processor-Memory Interconnections for Multiprocessors

A class of interconnection networks based on some existing permutation networks is described with applications to processor to memory communication in multiprocessing systems. These networks, termed delta networks, allow a direct link between any processor to any memory module. The delta networks and full crossbars are analyzed with respect to their effective bandwidth and cost. The analysis shows that delta networks have a far better performance per cost than crossbars in large multiprocessing systems.

[1]  Howard Jay Siegel,et al.  Study of multistage SIMD interconnection networks , 1978, ISCA '78.

[2]  Duncan H. Lawrie,et al.  On the Effective Bandwidth of Parallel Memories , 1977, IEEE Transactions on Computers.

[3]  R. Brent.  Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity , 1970 .

[4]  Alan Jay Smith,et al.  Interference in multiprocessor computer systems with interleaved memory , 1976, CACM.

[5]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[6]  Webb Miller.  Computational complexity and numerical stability , 1974, STOC '74.

[7]  Michael J. Flynn,et al.  Very high-speed computing systems , 1966 .

[8]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[9]  Francis Y. L. Chin,et al.  An O(n) algorithm for determining a near-optimal computation order of matrix chain products , 1978, CACM.

[10]  Marshall C. Pease,et al.  The Indirect Binary n-Cube Microprocessor Array , 1977, IEEE Transactions on Computers.

[11]  William Daniel Strecker.  An analysis of the instruction execution rate in certain computer structures , 1970 .

[12]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[13]  James Hardy Wilkinson,et al.  Rounding errors in algebraic processes , 1964, IFIP Congress.

[14]  J. Hopcroft,et al.  Triangular Factorization and Inversion by Fast Matrix Multiplication , 1974 .

[15]  Yoichi Muraoka,et al.  On the time required for a sequence of matrix products , 1973, CACM.

[16]  Sadashiva S. Godbole,et al.  On Efficient Computation of Matrix Chain Products , 1973, IEEE Transactions on Computers.

[17]  Grazia Lotti,et al.  O(n2.7799) Complexity for n*n Approximate Matrix Multiplication , 1979, Inf. Process. Lett..

[18]  James W. Burgmeier,et al.  A Round-Off Error Model with Applications to Arithmetic Expressions , 1979, SIAM J. Comput..

[19]  Nai-Kuan Tsao.  On “Accurate” evaluation of extended sums , 1979 .

[20]  Nai-Kuan Tsao.  The Numerical Instability of Bini's Algorithm , 1981, Inf. Process. Lett..

[21]  R. Brent.  Algorithms for matrix multiplication , 1970 .

[22]  Dileep Bhandarkar,et al.  Analysis of Memory Interference in Multiprocessors , 1975, IEEE Transactions on Computers.