Networks for sorting multitonic sequences

DOI10.1016/J.JPDC.2005.05.019MaRDI QIDQ852886zbMATH OpenOpenAlexFDO

Authors Joel I. Seiferas

Publication date 15 November 2006

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2005.05.019

zbMATH Keywords

analysis of algorithmsparallel processingsorting networkslong runsmerging networksparallel sortingpresortednessbitonic sortcomparison networksmerge exchange sortmultiway mergenearly sorted dataoblivious mergingoblivious sortingodd-even merge

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• Better understanding of Batcher's merging networks
• A sequential sorting network analogous to the batcher merge
• Periodic merging networks
• Merging in mixed radix sorting networks
• Periodic merging networks

Cited in

(7)

• A note on bitonic sorting
• Merging almost sorted sequences yields a 24-sorter
• K-way bitonic sort
• scientific article; zbMATH DE number 3885324 (Why is no real title available?)
• Merging in mixed radix sorting networks
• Bitonic sorters of minimal depth
• Combining Networks Using Cherry Picking Sequences

This page was built for publication: Networks for sorting multitonic sequences

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