Abstract.
We establish upper and lower bounds on the layout area of the butterfly network (without wraparound), which differ only in low-order terms. Specifically, the N -input, N -output butterfly network can be laid out in area (1 + o(1)) N 2 , while no layout of the network can have area smaller than (1 - o(1)) N 2 . These results improve both the known upper bound and the known lower bound on the area of butterfly network layouts.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received October 1996, and in final form February 1997.
Rights and permissions
About this article
Cite this article
Avior, A., Calamoneri, T., Even, S. et al. A Tight Layout of the Butterfly Network . Theory Comput. Systems 31, 475–488 (1998). https://doi.org/10.1007/s002240000098
Issue Date:
DOI: https://doi.org/10.1007/s002240000098