HPC-Netlib

High Performance Math Software


Parallel Sorting by Regular Sampling (PSRS)

Abstract
This package contains three implementations of a parallel sort using the algorithm of Parallel Sorting by Regular Sampling, as described in the paper: Xiaobo Li, Paul Lu, Jonathan Schaeffer, John Shillington, Pok Sze Wong and Hanmao Shi. On the Versatility of Parallel Sorting by Regular Sampling, Parallel Computing, vol. 19, pp. 1079-1103, 1993. Simply, the algorithm can be thought of as a three-part permutation. (Each part is itself a permutation, but we shall refer to them as parts of the total permutation to avoid confusion.)
DateOfInformation
Fri Jun 12 15:15:12 1998
Domain
Numerical Programs and Routines!Miscellaneous
Name
Parallel Sorting by Regular Sampling (PSRS)
TargetEnvironment
Fortran 77, UNIX. This package was implemented in (1) HP/Convex Exemplar shared memory model, (2) Oxford BSP, and (3) MPI.
TitleLine
three implementations of a parallel sort using the algorithm of Parallel Sorting by Regular Sampling
Version
1
Webpage
http://sdcd.gsfc.nasa.gov/ESS/exchange/contrib/mobarry/sorting/
ContactIs
Clark M. Mobarry

Meta Data URL from which this entry was created:
http://www.nhse.org/rib/repositories/hpc-netlib/objects/Asset/psrs.html
hpc-netlib@netlib.org