Abstract.
This paper shows that an N -node AKS network (as described by Paterson) can be embedded in a ( 3N / 2 ) -node twinbutterfly network (i.e., a multibutterfly constructed by superimposing two butterfly networks) with load 1, congestion 1, and dilation 2. The result has several implications, including the first deterministic algorithms for sorting and finding the median of nlog nitems on an n -input multibutterfly in O ( log n ) time, a work-efficient deterministic algorithm for finding the median of nlog2 nlog log nitems on an n -input multibutterfly in O (log nlog log n ) time, and a three-dimensional VLSI layout for the n -input AKS network with volume O(n 3/2 ) . While these algorithms are not practical, they provide further evidence of the robustness of multibutterfly networks. We also present a separate, and more practical, deterministic algorithm for routing h -relations on an n -input multibutterfly in O(h+ log n)time. Previously, only algorithms for solving hone-to-one routing problems were known. Finally, we show that a twinbutterfly, whose individual splitters do not exhibit expansion, can emulate a bounded-degree multibutterfly with (α,β) -expansion, for any α⋅β < 1/4 .
Author information
Authors and Affiliations
Additional information
Received July 23, 1997; revised May 18, 1998.
Rights and permissions
About this article
Cite this article
Maggs, B., Vöcking, B. Improved Routing and Sorting on Multibutterflies. Algorithmica 28, 438–464 (2000). https://doi.org/10.1007/s004530010049
Published:
Issue Date:
DOI: https://doi.org/10.1007/s004530010049