Bandwidth-based lower bounds on slowdown for efficient emulations of fixed-connection networks

This paper presents a new method for obtaining lower bounds on the slowdown of efficient emulations between network machines based on their communication bandwidth. The proofs measure the communication complexity of a message pattern by viewing its graph as a network machine and measuring the communication bandwidth β. This approach yields an intuitive lower bound on the time to route a communication pattern represented by multigraph C on a host machine H (with uniform load) as T ≥ &OHgr; (β(C)/β(H)), and thus a lower bound on the slowdown of emulating guest machine G on host H as the ratio of their communication bandwidths.

[1]  Francine Berman,et al.  On Mapping Parallel Algorithms into Parallel Architectures , 1987, J. Parallel Distributed Comput..

[2]  Bruce M. Maggs.  Locality in parallel computation , 1989 .

[3]  Larry Rudolph,et al.  A Complexity Theory of Efficient Parallel Algorithms , 1990, Theor. Comput. Sci..

[4]  Kevin Joel Rappoport.  Efficiency in parallel computation: algorithms, emulations, and VLSI pins , 1993 .

[5]  Shahid H. Bokhari,et al.  On the Mapping Problem , 1981, IEEE Transactions on Computers.

[6]  Arnold L. Rosenberg,et al.  Optimal simulations by Butterfly Networks , 1988, STOC '88.

[7]  D.I. Moldovan,et al.  On the design of algorithms for VLSI systolic arrays , 1983, Proceedings of the IEEE.

[8]  Arnold L. Rosenberg,et al.  Work-preserving emulations of fixed-connection networks , 1989, STOC '89.

[9]  Arnold L. Rosenberg.  GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions , 1988, AWOC.

[10]  Arnold L. Rosenberg,et al.  Cost Trade-offs in Graph Embeddings, with Applications , 1983, JACM.

[11]  John P. Fishburn,et al.  Quotient Networks , 1982, IEEE Transactions on Computers.

[12]  Marc Snir,et al.  Cost-Performance Tradeoffs for Interconnection Networks , 1992, Discret. Appl. Math..

[13]  Jan van Leeuwen,et al.  Simulation of Large Networks on Smaller Networks , 1986, Inf. Control..

[14]  I Ramakrishnan,et al.  On Mapping Cube Graphs on VLSI Array and Tree Architectures. , 1983 .

[15]  I. V. Ramakrishnan,et al.  On Mapping Homogeneous Graphs on a Linear Array-Processor Model , 1983, ICPP.

[16]  Arnold L. Rosenberg,et al.  Issues in the Study of Graph Embeddings , 1980, WG.

[17]  Bruce M. Maggs,et al.  Universal packet routing algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.