A new self-routing permutation network

DOI10.1109/12.509917MaRDI QIDQ4420974zbMATH OpenOpenAlexFDO

Authors Wang-Jiunn Cheng, Wen-Tsuen Chen

Publication date 1996

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

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

zbMATH Keywords

binary radix sorting networkbit sorting networksVLSI design

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• New self-routing permutation networks
• A fast VLSI-efficient self-routing permutation network
• Application of bipartite graphs for achieving race-free state assignments
• A fast parallel algorithm for routing in permutation networks
• Fast permutation routing in a class of interconnection networks

Cited in

(5)

• A fast VLSI-efficient self-routing permutation network
• New self-routing permutation networks
• Application of bipartite graphs for achieving race-free state assignments
• The half cleaner lemma: constructing efficient interconnection networks from sorting networks
• Arbitrary-size permutation networks using arbitrary-radix switches

This page was built for publication: A new self-routing permutation network

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