On the bisection width and expansion of butterfly networks

This paper proves tight bounds on the bisection width and expansion of butterfly networks with and without wraparound. We show that the bisection width of an n-input butterfly network is 2(√2 -1)n + o(n) ≈ 0.82n without wraparound, and n with wraparound. The former result is surprising, since it contradicts the prior "folklore" belief that the bisection width is n. We also show that every set of k nodes has at least (k/(2 log k)) (1 - o(1)) neighbors in a butterfly without wraparound, and at least (k/ log k)(1 -o(1)) neighbors in a butterfly with wraparound, if k is o(√n) and o(n), respectively.

Duke Scholars

Author Bruce Maggs Computer Science