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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Previous parallel sorting algorithms do not scale to the largest available machines, since they either have prohibitive… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • table 1
Is this relevant?
2014
2014
A snark is a cubic cyclically 4-edge connected graph with edge chromatic number four and girth at least five. We say that a graph… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
Data sorting is an important process in digital signal processing. There were many researches related to data sorting, two of… (More)
  • 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… (More)
Is this relevant?
2010
2010
In recent years, many researchers have investigated optical interconnections as parallel computing. Optical interconnections are… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2007
2007
This paper describes a new parallel sorting algorithm, derived from the odd-even mergesort algorithm, named "partition and… (More)
  • figure 1
  • table I
  • table II
  • table III
  • table IV
Is this relevant?
1999
1999
External sorting—the process of sorting a file that is too large to fit into the computer's internal memory and must be stored… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
Is this relevant?
1994
1994
This paper presents two novel sorting network-based architectures for computing high sample rate nonrecursive rank order filters… (More)
  • table 2
  • figure 1
  • figure 5
Is this relevant?
1986
1986
For each value to be sorted in the process of the parallel bubble sort computation, we evaluate the exact time necessary to route… (More)
Is this relevant?
1985
1985
We develop models of secondary storage to evaluate external sorting and use them to analyze the average I/O access time of… (More)
  • figure 6
  • table I
  • table II
Is this relevant?