Metrics for Metrics: Why It Is Difficult to Compare Interconnection Networks Or How Would You Compare an Alligator to an Armadillo?

Difficulties associated with metric-based design and evaluation of interconnection networks, in the context of massively parallel processing systems, are discussed from a relatively philosophical perspective. The issuesTywhich metric or weighted set of metrics to use@ehow to meaningfully apply metrics“46“are central themes throughout the paper. It is difficult to isolate meaningful comparative network performance measurements when using application benchmarks on different systems. Furthermore, the strong interdependence among application, system, and network parameters makes it difSlcult to apply the classical experimental method, which is to “measure” the effect of changing one parameter while holding all other parameters constant. The issue of fairness is discussed in the context of the classical experimental method, and one aspect of fairness related to algorithm mapping is illustrated through an example.

[1]  Howard Jay Siegel,et al.  A survey and comparison of fault-tolerant multistage interconnection networks , 1994 .

[2]  Ralph Grishman,et al.  The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer , 1983, IEEE Transactions on Computers.

[3]  Howard Jay Siegel,et al.  International Conference on Parallel Processing Reducing the Effect of Hot Spots by Using a Multipath Network , 2006 .

[4]  Anant Agarwal,et al.  Limits on Interconnection Network Performance , 1991, IEEE Trans. Parallel Distributed Syst..

[5]  Kevin P. McAuliffe,et al.  The IBM Research Parallel Processor Prototype (RP3): Introduction and Architecture , 1985, ICPP.

[6]  G. Jack Lipovski,et al.  Parallel computing - theory and comparisons , 1987 .

[7]  Gerald M. Masson,et al.  A Sampler of Circuit Switching Networks , 1979, Computer.

[8]  Howard Jay Siegel,et al.  Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.) , 1985 .

[9]  Duncan H. Lawrie,et al.  A Class of Redundant Path Multistage Interconnection Networks , 1983, IEEE Transactions on Computers.

[10]  Manoj Kumar,et al.  The Onset of Hot-Spot Contention , 1986, ICPP.

[11]  C. Thomborson,et al.  A Complexity Theory for VLSI , 1980 .

[12]  Howard Jay Siegel,et al.  Using the multistage cube network topology in parallel supercomputers , 1989 .

[13]  L. W. Tucker,et al.  Architecture and applications of the Connection Machine , 1988, Computer.

[14]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[15]  Chuan-Lin Wu,et al.  Interconnection Networks for Parallel and Distributed Processing , 1984 .

[16]  Monty Denneau,et al.  The GF11 supercomputer , 1985, ISCA '85.

[17]  Leonard Kleinrock,et al.  A Tradeoff Study of Switching Systems in Computer Communication Networks , 1980, IEEE Transactions on Computers.

[18]  Howard Jay Siegel,et al.  PASM: A Partitionable SIMD/MIMD System for Image Processing and Pattern Recognition , 1981, IEEE Transactions on Computers.

[19]  Jacques Lenfant,et al.  Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations , 1978, IEEE Transactions on Computers.

[20]  Krishnan Padmanabhan,et al.  Performance of the Direct Binary n-Cube Network for Multiprocessors , 1989, IEEE Trans. Computers.

[21]  Leonard Kleinrock,et al.  Performance analysis of finite-buffered multistage interconnection networks with a general traffic pattern , 1991, SIGMETRICS '91.

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

[23]  Howard Jay Siegel,et al.  Software Issues for the PASM Parallel Processing System , 1993 .

[24]  Chuan-lin Wu,et al.  Tutorial, interconnection networks for parallel and distributed processing , 1984 .

[25]  Tomás Lang,et al.  Nonuniform Traffic Spots (NUTS) in Multistage Interconnection Networks , 1990, J. Parallel Distributed Comput..

[26]  Howard Jay Siegel,et al.  The Extra Stage Cube: A Fault-Tolerant Interconnection Network for Supersystems , 1982, IEEE Transactions on Computers.

[27]  Ralph Grishman,et al.  The NYU ultracomputer: An MIMD shared memory parallel computer , 1984 .

[28]  Trevor Mudge,et al.  Hypercube supercomputers , 1989, Proc. IEEE.

[29]  J. Robert Heath,et al.  Classification Categories and Historical Development of Circuit Switching Topologies , 1983, CSUR.

[30]  Howard Jay Siegel,et al.  Mapping computer-vision-related tasks onto reconfigurable parallel-processing systems , 1992, Computer.

[31]  Krishnan Padmanabhan,et al.  Performance of Multicomputer Networks under Pin-out Constraints , 1991, J. Parallel Distributed Comput..

[32]  Dharma P. Agrawal,et al.  A Survey and Comparision of Fault-Tolerant Multistage Interconnection Networks , 1987, Computer.