A comparison of sorting algorithms for the connection machine CM-2
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Parallel sorting by regular sampling
Journal of Parallel and Distributed Computing
On the versatility of parallel sorting by regular sampling
Parallel Computing
Parallel sorting by over partitioning
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
The Paderborn University BSP (PUB) Library - Design, Implementation and Performance
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
IWCC '99 Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing
An Out-of-Core Sorting Algorithm for Clusters with Processors at Different Speed
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
Hi-index | 0.00 |
In this paper we use the notion of quantile to implement Parallel Sorting by Regular Sampling (PSRS) on homogeneous clusters and we introduce a new algorithm for in-core parallel sorting integer keys which is based on the sampling technique. The algorithm is devoted to clusters with processors running at different speeds correlated by a multiplicative constant factor. This is a weak definition of nonhomogeneous clusters but a first attempt (to our knowledge) in this direction.