Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Previous parallel sorting algorithms do not scale to the largest available machines, since they either have prohibitive… Expand
  • figure 1
  • figure 3
  • figure 5
  • figure 6
  • table 1
Is this relevant?
2015
2015
This paper describes our new algorithm for sorting an array of structures by efficiently exploiting the SIMD instructions and… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2013
2013
  • R. Putra
  • International Conference on ICT for Smart Society
  • 2013
  • Corpus ID: 16247507
Data sorting is an important process in digital signal processing. There were many researches related to data sorting, two of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2011
2011
Odd-Even merge sort is a basic problem in computer supported cooperative work in design area. However, it is not effective… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2010
2010
In recent years, many researchers have investigated optical interconnections as parallel computing. Optical interconnections are… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1998
1998
We examine the average running times of Batcher's bitonic merge and Batcher's odd-even merge when they are used as parallel… Expand
  • figure 4
Is this relevant?
1997
1997
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1994
1994
This paper presents two novel sorting network-based architectures for computing high sample rate nonrecursive rank order filters… Expand
  • table 2
  • figure 1
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Sorting network based architectures for computing nonrecursive and recursive median filters are presented. The proposed… Expand
  • figure 2
  • figure 5
Is this relevant?
1986
1986
Abstract For each value to be sorted in the process of the parallel bubble sort computation, we evaluate the exact time necessary… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?