Networks for sorting multitonic sequences

DOI10.1016/J.JPDC.2005.05.019zbMATH Open1106.68352OpenAlexW119083840MaRDI QIDQ852886FDOQ852886

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

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

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)

Cited In (6)

• Bitonic sorters of minimal depth
• A note on bitonic sorting
• Title not available (Why is that?)
• Merging in mixed radix sorting networks
• Combining Networks Using Cherry Picking Sequences
• K-way bitonic sort

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)