K-way bitonic sort

DOI10.1109/12.16506MaRDI QIDQ3817626zbMATH OpenOpenAlexFDO

Authors Toshio Nakatani, Shing-Tsaan Huang, Bruce W. Arden, Satish K. Tripathi

Publication date 1989

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

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

zbMATH Keywords

bitonic sortparallel processingparallel sortingsorting networks

Mathematics Subject Classification ID

Theory of operating systems (68N25) Searching and sorting (68P10)

Recommendations

• k-bitonic sort
• Bitonic sorters of minimal depth
• Networks for sorting multitonic sequences
• Constructing sorting networks from k-sorters
• Systolic sorting in a sequential input/output environment

Cited in

(8)

• Optimal conclusive sets for comparator networks
• k-bitonic sort
• Sloping-and-shaking
• scientific article; zbMATH DE number 5630647 (Why is no real title available?)
• Bitonic sorters of minimal depth
• The strongest model of computation obeying 0-1 Principles
• Towards simpler sorting networks and monotone circuits for majority
• Accelerating certain outputs of merging and sorting networks

This page was built for publication: K-way bitonic sort

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