Parallel Algorithms to Set Up the Benes Permutation Network

DOI10.1109/TC.1982.1675960MaRDI QIDQ3967483zbMATH OpenFDO

Authors David Nassimi, Sartaj Sahni

Publication date 1982

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

Full work available at URL https://doi.org/10.1109/TC.1982.1675960

zbMATH Keywords

Benes permutation networkparallel algorithmperfect shuffle computer

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(8)

• Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers
• Divide-and-conquer algorithms on the hypercube
• Analyzing permutation capability of multistage interconnection networks with colored Petri nets
• Fast algorithms for bit-serial routing on a hypercube
• A unified framework for off-line permutation routing in parallel networks
• Fast reconfiguration algorithms for time, space, and wavelength dilated optical Benes networks
• On the construction of balanced matrices
• The half cleaner lemma: constructing efficient interconnection networks from sorting networks

This page was built for publication: Parallel Algorithms to Set Up the Benes Permutation Network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3967483)