Parallel Algorithms to Set Up the Benes Permutation Network

DOI10.1109/TC.1982.1675960zbMath0501.94019MaRDI QIDQ3967483

David Nassimi, Sartaj K. Sahni

Publication date: 1982

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmperfect shuffle computerBenes permutation network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Divide-and-conquer algorithms on the hypercube, The Half Cleaner Lemma: Constructing Efficient Interconnection Networks from Sorting Networks, On the construction of balanced matrices, Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers, Fast algorithms for bit-serial routing on a hypercube, A unified framework for off-line permutation routing in parallel networks, Analyzing permutation capability of multistage interconnection networks with colored Petri nets, Fast reconfiguration algorithms for time, space, and wavelength dilated optical Benes networks