Area efficient layouts of the Batcher sorting networks

DOI10.1002/NET.10003MaRDI QIDQ4537608zbMATH OpenOpenAlexFDO

Authors Shimon Even

Publication date 1 July 2002

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.10003

zbMATH Keywords

ATM switchbitonicsorting networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Searching and sorting (68P10)

Recommendations

• Improved layout of the odd-even sorting network
• scientific article; zbMATH DE number 3940717
• Tight Bounds on the Complexity of Parallel Sorting
• Minimum Storage Sorting Networks
• A Minimum Area VLSI Network for O(log n) Time Sorting

Cites work

• Compact grid layouts of multi-level networks
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)

Cited in

(4)

• Toward a lower bound for sorting networks
• The half cleaner lemma: constructing efficient interconnection networks from sorting networks
• Improved layout of the odd-even sorting network
• A lower bound on the area of permutation layouts

This page was built for publication: Area efficient layouts of the Batcher sorting networks

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