Universal emulations with sublogarithmic slowdown

The existence of bounded degree networks which can emulate the computation of any bounded degree network of the same size with logarithmic slowdown is well-known. The butterfly is an example of such a universal network. Leiserson was the first to introduce the concept of an area-universal network: a network with VLSI layout area A which can emulate any network of the same size and layout area with logarithmic slowdown. His results imply the existence of an N-node network with layout area O(N log/sup 2/ N) which can emulate any N-node planar network with O(log N) slowdown. The main results of this paper are: There exists an N-node network with layout area O(N log/sup 2/ N) which can emulate any N-node planar network with O(loglogN) slowdown. The N-node butterfly (and hypercube) can emulate any network with VLSI layout area N/sup 2-/spl epsiv// (/spl epsiv/>0) with O(loglogN) slowdown. We also discuss sublogarithmic bounds for the slowdown of emulations of arbitrary bounded degree networks.<<ETX>>

[1]  Philip N. Klein,et al.  Excluded minors, network decomposition, and multicommodity flow , 1993, STOC.

[2]  Charles E. Leiserson,et al.  Area-Efficient VLSI Computation , 1983 .

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

[4]  Satish Rao,et al.  New graph decompositions and fast emulations in hypercubes and butterflies , 1993, SPAA '93.

[5]  Béla Bollobás,et al.  THE ASYMPTOTIC NUMBER OF UNLABELLED REGULAR GRAPHS , 1982 .

[6]  Bruce M. Maggs,et al.  On-line algorithms for path selection in a nonblocking network , 1990, STOC '90.

[7]  Bruce M. Maggs,et al.  Expanders might be practical: fast algorithms for routing around faults on multibutterflies , 1989, 30th Annual Symposium on Foundations of Computer Science.

[8]  Leslie G. Valiant,et al.  Universality considerations in VLSI circuits , 1981, IEEE Transactions on Computers.

[9]  Bruce M. Maggs,et al.  On the fault tolerance of some popular bounded-degree networks , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[10]  Eli Upfal,et al.  An O(log N) deterministic packet-routing scheme , 1992, JACM.

[11]  Baruch Awerbuch,et al.  Sparse partitions , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[12]  Arnold L. Rosenberg,et al.  Optimal simulations of tree machines , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[13]  Charles E. Leiserson,et al.  Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.

[14]  R. Ravi,et al.  Approximation through multicommodity flow , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[15]  Richard Cole,et al.  Multi-scale self-simulation: a technique for reconfiguring arrays with faults , 1993, STOC '93.

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

[17]  Eric J. Schwabe.  On the computational equivalence of hypercube-derived networks , 1990, SPAA '90.

[18]  V. Benes.  Optimal rearrangeable multistage connecting networks , 1964 .

[19]  Gary L. Miller,et al.  A unified geometric approach to graph separators , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.