| Abstract Improved Routing and Sorting on Multibutterflies (2008) | |||||||||||||||
Abstract | |||||||||||||||
| This paper shows that an ¢-node AKS network (as ¤ described by Paterson) can be embedded £ ¥ in a-node degree-8 multibutterfly network with load 1, congestion 1, and dilation 2. The result has several implications, including the first deterministic algorithms for sorting and finding the me-¦¨§�©��� ¦ dian of keys ¦ on an-input ����§�©���¦�� multibutterfly in time, a work-efficient deterministic algorithm for finding ¥ the ¦�§�©� � ¦�§�©���§�©��� ¦ median of keys ¦ on an-input multibutter-����§�©���¦�§�©���§�©���¦� � fly in time, and a three-dimensional ¥ VLSI layout ¦ for the-input AKS network ���� ¦ £� � � with volume. While these algorithms are not practical, they provide further evidence of the robustness of multibutterfly networks. | |||||||||||||||
Details der Publikation | |||||||||||||||
| |||||||||||||||