Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
A new sort algorithm: self-indexed sort
ACM SIGPLAN Notices
Parallel computing in Ada: an overview and critique
ACM SIGAda Ada Letters
Parallel computation: models and methods
Parallel computation: models and methods
Parallel Sorting Algorithms
Parallel Self-Index Integer Sorting
The Journal of Supercomputing
Program Portability Across Parallel Architectures - SIMD/MIMD/SPMD/Shared/Distributed
Proceedings of the 8th International Symposium on Parallel Processing
Practical Parallel List Ranking
IRREGULAR '97 Proceedings of the 4th International Symposium on Solving Irregularly Structured Problems in Parallel
Distributed and parallel execution in Ada 83
WPDRTS '95 Proceedings of the 3rd Workshop on Parallel and Distributed Real-Time Systems
Writing correct parallel programs
IPPS '93 Proceedings of the 1993 Seventh International Parallel Processing Symposium
The data-parallel Ada run-time system, simulation and empirical results
IPPS '93 Proceedings of the 1993 Seventh International Parallel Processing Symposium
| Hi-index | 0.00 |
Integer sorting is a special case of the sorting problem, where the elements have integer values in the range [0,n–1]. We evaluate the behavior and performance of two parallel integer sorting algorithms in practice. We have used Ada tasks facilities to simulate the parallel sorting algorithms on a machine consisting of 4-processors. Both algorithms are based on self-index method on EREW PRAM [3,6]. Also, we study the scalability of the two parallel algorithms and compare between them.