Layouts for the shuffle-exchange graph based on the complex plane diagram
SIAM Journal on Algebraic and Discrete Methods
Sorting in c log n parallel steps
Combinatorica
Work-preserving emulations of fixed-connection networks
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
An O(logN) deterministic packet routing scheme
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the computational equivalence of hypercube-derived networks
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Cray Y-MP C90: system features and early benchmark results
Parallel Computing
Tight analyses of two local load balancing algorithms
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On-line Algorithms for Path Selectionin a Nonblocking Network
SIAM Journal on Computing
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
A tight layout of the butterfly network
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Improved routing and sorting on multibutterflies
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
A complexity theory for VLSI
AT2L2 o N2/2 for fast fourier transform in multilayer VLSI
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
On the VLSI Area and Bisection Width of Star Graphs and Hierarchical Cubic Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Mapping of Discrete Cosine Transforms onto Distributed Hardware Architectures
Journal of Signal Processing Systems
DPillar: Dual-port server interconnection network for large scale data centers
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
This paper proves tight bounds on the bisection width and expansion of butterfly networks with and without wraparound. Previously it was known that the bisection width of an n-input butterfly with wraparound is n. We show that without wraparound, the bisection width is 2(驴2 - 1)n + o(n)驴 .82n. This result is surprising because it contradicts the prior "folklore" belief that the bisection width is n in both cases. We also show that for every set A of k nodes in a butterfly with wraparound there are at least (4 + o(1))k/log k edges from A to A, provided that k = o(n).