K-way bitonic sort

DOI10.1109/12.16506zbMATH Open0666.68065OpenAlexW1985559048MaRDI QIDQ3817626FDOQ3817626

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

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

zbMATH Keywords

parallel processingsorting networksparallel sortingbitonic sort

Mathematics Subject Classification ID

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

Cited In (7)

• Bitonic sorters of minimal depth
• \(k\)-bitonic sort
• Sloping-and-shaking
• Title not available (Why is that?)
• The strongest model of computation obeying 0-1 Principles
• Optimal conclusive sets for comparator networks
• 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)