Parallel Self-Index Integer Sorting

Authors:
Hazem M. Bahig;Sameh S. Daoud;Mahmoud K. A. Khairat
Affiliations:
Department of Mathematics, Faculty of Science, Ain Shams University, Cairo, Egypt HBahig@asunet.shams.edu.eg;Department of Mathematics, Faculty of Science, Ain Shams University, Cairo, Egypt;Department of Mathematics, Faculty of Science, Ain Shams University, Cairo, Egypt
Venue:
The Journal of Supercomputing
Year:
2002

Citing 18
Cited 1

Towards optimal parallel bucket sorting

Information and Computation
A parallel bucket sort

Information Processing Letters
Parallel merge sort

SIAM Journal on Computing
Optimal and sublogarithmic time randomized parallel sorting algorithms

SIAM Journal on Computing
A complexity theory of efficient parallel algorithms

Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
On parallel hashing and integer sorting

Proceedings of the seventeenth international colloquium on Automata, languages and programming
The parallel simplicity of compaction and chaining

Proceedings of the seventeenth international colloquium on Automata, languages and programming
The power of Collision: randomized parallel algorithms for chaining and integer sorting

FST and TC 10 Proceedings of the tenth conference on Foundations of software technology and theoretical computer science
Parallel algorithms for shared-memory machines

Handbook of theoretical computer science (vol. A)
Improved deterministic parallel integer sorting

Information and Computation
Ultra-fast expected time parallel algorithms

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
On parallel integer sorting

Acta Informatica
Parallel integer sorting using small operations

Acta Informatica
Fast parallel space allocation, estimation, and integer sorting

Information and Computation
A new sort algorithm: self-indexed sort

ACM SIGPLAN Notices
Improved parallel integer sorting without concurrent writing

Information and Computation
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Improved bounds for integer sorting in the EREW PRAM model

Journal of Parallel and Distributed Computing

Practical integer sorting on shared memory

HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of sorting n integers when the elements are drawn from the restricted domain [1…n]. A new deterministic parallel algorithm for sorting n integers is obtained. Its running time is O(lognlog(n/logn)) using n/logn processors on EREW (exclusive read exclusive write) PRAM (parallel random access machine). Also, our algorithm was modified to become optimal when we use \sqrt{n} processors. This algorithm belongs to class EP (Efficient, Polynomial fast).