Constructing sorting networks from k-sorters

DOI10.1016/0020-0190(89)90196-8zbMath0689.68088OpenAlexW1968119892WikidataQ38772864 ScholiaQ38772864MaRDI QIDQ582119

Bruce Parker, Ian Parberry

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90196-8

zbMATH Keywords

analysis of algorithmsparallel processingmerging networks

Mathematics Subject Classification ID

Searching and sorting (68P10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Related Items (5)

Sloping-and-shaking ⋮ Fragile complexity of adaptive algorithms ⋮ Fragile complexity of comparison-based algorithms ⋮ Fragile complexity of adaptive algorithms ⋮ An efficient multiway merging algorithm

Cites Work

• Unnamed Item
• Sorting in \(c \log n\) parallel steps
• Tight Bounds on the Complexity of Parallel Sorting
• A parallel sorting scheme whose basic operation sortsN elements
• Improved Divide/Sort/Merge Sorting Networks

This page was built for publication: Constructing sorting networks from k-sorters