A New Parallel Sorting Algorithm based on Odd-Even Mergesort

@article{Herruzo2007ANP,
  title={A New Parallel Sorting Algorithm based on Odd-Even Mergesort},
  author={Ezequiel Herruzo and Guillermo Ru{\'i}z and Jos{\'e} Ignacio Benavides Ben{\'i}tez and Oscar G. Plata},
  journal={15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07)},
  year={2007},
  pages={18-22}
}
This paper describes a new parallel sorting algorithm, derived from the odd-even mergesort algorithm, named "partition and concurrent merging" (PCM). The proposed algorithm is based on a divide-and-conquer strategy. First, the data sequence to be sorted is decomposed in several pieces that are sorted in parallel using Quicksort. After that, all pieces are merged using a recursive procedure to obtain the final sorted sequence. In each iteration of this procedure pairs of sequence pieces are… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 12 REFERENCES

Algorithms in Java

VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

Introduction to Parallel Computing

A. Grama
  • 2nd Edition, Addison-Wesley,
  • 2003
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

Parallel programming in openMP

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Integer Sorting on Shared-Memory Vector Parallel Computers

  • International Conference on Supercomputing
  • 1998
VIEW 1 EXCERPT

Shellsort and Sorting Networks

  • Outstanding Dissertations in the Computer Sciences
  • 1972
VIEW 1 EXCERPT

Sorting Networks and Their Applications

  • AFIPS Spring Joint Computing Conference
  • 1968
VIEW 1 EXCERPT