Parallel Sorting Algorithms with Sampling Techniques on Clusters with Processors Running at Different Speeds

  • Authors:
  • Christophe Cérin;Jean-Luc Gaudiot

  • Affiliations:
  • -;-

  • Venue:
  • HiPC '00 Proceedings of the 7th International Conference on High Performance Computing
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.