Layouts for the shuffle-exchange graph based on the complex plane diagram
SIAM Journal on Algebraic and Discrete Methods
A logarithmic time sort for linear size networks
Journal of the ACM (JACM)
Efficient simulations among several models of parallel computers
SIAM Journal on Computing
Tight bounds on the complexity of parallel sorting
IEEE Transactions on Computers
Optimal simulations by Butterfly Networks
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Towards an architecture-independent analysis of parallel algorithms
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
New layouts for the shuffle-exchange graph(Extended Abstract)
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Dynamic tree embeddings in butterflies and hypercubes
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
On the computational equivalence of hypercube-derived networks
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Optimal dynamic scheduling of task tree on constant-dimensional architectures
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A VLSI decomposition of the deBruijn graph
Journal of the ACM (JACM)
New graph decompositions and fast emulations in hypercubes and butterflies
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Multi-scale self-simulation: a technique for reconfiguring arrays with faults
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Bandwidth-based lower bounds on slowdown for efficient emulations of fixed-connection networks
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Optimal trade-offs between size and slowdown for universal parallel networks
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Improved methods for hiding latency in high bandwidth networks (extended abstract)
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Automatic methods for hiding latency in high bandwidth networks (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
New approximation techniques for some ordering problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A Benes-Like Theorem for the Shuffle-Exchange Graph
IEEE Transactions on Computers
Products of Networks with Logarithmic Diameter and Fixed Degree
IEEE Transactions on Parallel and Distributed Systems
Efficient embeddings of ternary trees into hypercubes
Journal of Parallel and Distributed Computing
On the Bisection Width and Expansion of Butterfly Networks
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Emulating Direct Products by Index-Shuffle Graphs
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Efficient automatic simulation of parallel computation on networks of workstations
Discrete Applied Mathematics
Efficient automatic simulation of parallel computation on networks of workstations
Discrete Applied Mathematics
Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks
Theory of Computing Systems
Hi-index | 0.00 |
In this paper, we study the problem of emulating TG steps of an NG-node guest network on an NH-node host network. We call an emulation work-preserving if the time required by the host, TH, is &Ogr;(TGNG/NH) because then both the guest and host networks perform the same total work, &THgr;(TGNG), to within a constant factor. We say that an emulation is real-time if TH = &Ogr;(TG), because then the host emulates the guest with constant delay. Although many isolated emulation results have been proved for specific networks in the past, and measures such as dilation and congestion were known to be important, the field has lacked a model within which general results and meaningful lower bounds can be proved. We attempt to provide such a model, along with corresponding general techniques and specific results in this paper. Some of the more interesting and diverse consequences of this work include:a proof that a linear array can emulate a (much larger) butterfly in a work-preserving fashion, but that a butterfly cannot emulate an expander (of any size) in a work-preserving fashion.a proof that a mesh can be emulated in real time in a work-preserving fashion on a butterfly, even though any &Ogr;(1)-to-1 embedding of a mesh in a butterfly has dilation &OHgr;(log N),a proof that an N log N-node butterfly can be emulated in a work-preserving fashion on an N-node shuffle-exchange graph, and vice-versa,simple &Ogr;(N2/log2 N)-area and &Ogr;(N3/2/log3/2 N)-volume layouts for the N-node shuffle-exchange graph, andan algorithm for sorting N-numbers in &Ogr;(log N) steps with high probability on an N-node shuffle-exchange graph with constant size queues.