Skip to search formSkip to main contentSkip to account menu

Batcher odd–even mergesort

Known as: Odd-even mergesort, Batcher's odd-even merge, Batcher odd-even mergesort 
Batcher's odd–even mergesort is a generic construction devised by Ken Batcher for sorting networks of size O(n (log n)2) and depth O((log n)2), where… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Array data structureBitonic sorterKen BatcherOdd–even sort

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
An Efficient Multiway Mergesort for GPU Architectures
Sorting is a primitive operation that is a building block for countless algorithms. As such, it is important to design sorting… 
Highly Cited
2015
Highly Cited
2015
SIMD- and Cache-Friendly Algorithm for Sorting an Array of Structures
This paper describes our new algorithm for sorting an array of structures by efficiently exploiting the SIMD instructions and… 
2014
2014
Implementation of a High-Throughput Modified Merge Sort in MIMO Detection Systems
Wireless communication technology continues to advance at a rapid pace, and researchers have made tremendous progress in… 
2013
2013
VLSI design of parallel sorter based on modified PCM algorithm and Batcher's odd-even mergesort
Data sorting is an important process in digital signal processing. There were many researches related to data sorting, two of… 
2005
2005
Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms
Branch mispredictions is an important factor affecting the running time in practice. In this paper we consider tradeoffs between… 
1999
1999
A Simple and Efficient Parallel Disk Mergesort
Abstract. External sorting—the process of sorting a file that is too large to fit into the computer's internal memory and must be… 
1997
1997
Efficient oblivious parallel sorting on the MasPar MP-1
The authors address the problem of sorting a large number N of keys on a MarPar MP-1 parallel SIMD machine of moderate size P… 
1994
1994
Novel sorting network-based architectures for rank order filters
This paper presents two novel sorting network-based architectures for computing high sample rate non recursive rank order filters… 
Highly Cited
1993
Highly Cited
1993
Sorting network based architectures for median filters
Sorting network based architectures for computing nonrecursive and recursive median filters are presented. The proposed… 
1985
1985
The I/O Performance of Multiway Mergesort and Tag Sort
We develop models of secondary storage to evaluate external sorting and use them to analyze the average I/O access time of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)