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)

Semantic Scholar uses AI to extract papers important to this topic.

2011

2011

- Josef Angermeier, Eugen Sibirko, Rolf Wanka, Jürgen Teich
- 2011 IEEE International Symposium on Parallel and…
- 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)

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)

Is this relevant?

2000

2000

- Jae-dong Lee, Kenneth E. Batcher
- IEEE Trans. Parallel Distrib. Syst.
- 2000

ÐThis paper presents bitonic sorting schemes for special-purpose parallel architectures such as sorting networks and for general… (More)

Is this relevant?

1997

1997

- Mihai F. Ionescu
- IPPS
- 1997

Sorting is an important component of many applications, and parallel sorting algorithms have been studied extensively in the last… (More)

Is this relevant?

1993

1993

- Kathy J. Liszka, Kenneth E. Batcher
- 1993 International Conference on Parallel…
- 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)

Is this relevant?

1991

1991

- Tim Oliver
- 1991

The bitonic sort algorithm is a parallel sorting algorithm that has been implemented in sorting networks and is readily adaptable… (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha
- SPAA
- 1991

We have implemented three parallel sorting algorithms on the Connection Machine Supercomputer model CM-2: B atcher’s bitonic sort… (More)

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)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- Gianfranco Bilardi, Alexandru Nicolau
- SIAM J. Comput.
- 1989

A parallel algorithm, called adaptive bitonic sorting, that runs on a PRAC (parallel random access computer), a shared-memory… (More)

Is this relevant?

Highly Cited

1979

Highly Cited

1979

- David Nassimi, Sartaj Sahni
- IEEE Transactions on Computers
- 1979

An O(n) algorithm to sort n<sup>2</sup>elements on an Illiac IV-like n × n mesh-connected processor array is presented. This… (More)

Is this relevant?