The Community for Technology Leaders
Green Image
<p>Simple deterministic O(log N)-step algorithms for routing permutations of packets in multibutterflies and randomly wired splitter networks are described. The algorithms are robust against faults (even in the worst case), and are efficient from a practical point of view. As a consequence, it is found that the multibutterfly is an excellent candidate for a high-bandwidth low-diameter switching network underlying a shared-memory machine.</p>
fault routing algorithms; deterministic; algorithms; packet permutations routing; multibutterflies; randomly-wired splitter networks; switching network; shared-memory machine; computational complexity; fault tolerant computing; multiprocessor interconnection networks.
F.T. Leighton, B.M. Maggs, "Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks", IEEE Transactions on Computers, vol. 41, no. , pp. 578-587, May 1992, doi:10.1109/12.142684
87 ms
(Ver 3.1 (10032016))