Regular articleParallel sorting by regular sampling☆
References (26)
An algorithm with decentralized control for sorting files in a network
J. Parallel Distrib. Comput.
(1989)- et al.
Clustering techniques: The user's dilemma
Pattern Recognition
(1976) - et al.
The parallel neighbor sort and two-way merge algorithm
Parallel Comput.
(1986) - et al.
Problem-heap: A paradigm for multiprocessor algorithms
Parallel Comput.
(1987) Parallel sorting algorithms for tightly coupled multiprocessors
Parallel Comput.
(1988)- et al.
Data communication in hypercube
J. Parallel Distrib. Comput.
(1989) Sorting a distributed file in a network
Computer Networks
(1984)- et al.
Load balanced sort on hypercube multiprocessors
Parallel Sorting Algorithms
(1985)Sorting networks and their applications
PAMS/SPS-2 system overview
Experience with multiprocessor algorithms
IEEE Trans. Comput.
(1982)
Analysis of the performance of the parallel quicksort method
BIT
(1985)
Cited by (154)
Toward highly parallel loading of unstructured meshes
2022, Advances in Engineering SoftwareCitation Excerpt :The algorithm is general enough to be able to load an unstructured mesh from an arbitrary database format. The algorithm can easily be utilized by other researchers since the implementation is freely available as a library with a simple C API [1–33]. Using the library, one can obtain the fully parallel loader with the ability to prepare data for his/her favourite parallel decomposer (which provides a decomposition of a requested quality).
Optimizing the gravitational tree algorithm for many-core processors
2024, Monthly Notices of the Royal Astronomical SocietyPerformance Evaluation of Parallel Sortings on the Supercomputer Fugaku
2023, Journal of Information ProcessingParallel analysis of Ethereum blockchain transaction data using cluster computing
2022, Cluster Computing
- ☆
Funding for this research was provided by the Canadian Natural Sciences and Engineering Research Council, Grant OGP-8173.
Copyright © 1992 Published by Elsevier Inc.