Bitonic sorter

Known as: Bitonic mergesort, Bitonic sort, Batcher sort 
Bitonic mergesort is a parallel algorithm for sorting. It is also used as a construction method for building a sorting network. The algorithm was… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2016
051019772016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Sorting is one of the most investigated tasks computers are used for. Up to now, not much research has been put into increasing… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2007
2007
The grid-area required by a sorting net for input vectors of length N is shown to be at least (N ? 1) 2 =2. Of all sorting nets… (More)
  • figure 3
  • figure 4
  • figure 5
  • figure 8
Is this relevant?
2000
2000
ÐThis paper presents bitonic sorting schemes for special-purpose parallel architectures such as sorting networks and for general… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
1997
1997
Sorting is an important component of many applications, and parallel sorting algorithms have been studied extensively in the last… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1993
1993
The bitonic sorting network will sort N-2^m keys in O(log^2N) time with 0(Nlog^2N) comparators. Developments on the sorter enable… (More)
  • figure 3
Is this relevant?
1991
1991
The bitonic sort algorithm is a parallel sorting algorithm that has been implemented in sorting networks and is readily adaptable… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We have implemented three parallel sorting algorithms on the Connection Machine Supercomputer model CM-2: B atcher’s bitonic sort… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 6
  • figure 6
Is this relevant?
1989
1989
  • S.J. Simmons
  • Conference Proceeding IEEE Pacific Rim Conference…
  • 1989
An implementation of the M-algorithm based on a bitonic sorter is proposed for VLSI implementation. The sorting network is… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1989
Highly Cited
1989
A parallel algorithm, called adaptive bitonic sorting, that runs on a PRAC (parallel random access computer), a shared-memory… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1979
Highly Cited
1979
An O(n) algorithm to sort n<sup>2</sup>elements on an Illiac IV-like n &#215; n mesh-connected processor array is presented. This… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?