JOURNAL ARTICLE
Improved sorting algorithms for parallel computers
Abstract
We make observations that improve processor utilization and decrease communication overhead for several parallel sorting algorithms. These lead to constant factor improvements on the best previous parallel sorting bounds for both mesh-connected and linearly connected parallel architectures [2,12] (Previous bounds were within a constant factor of optimal.). These improved bounds are achieved using fewer processors with greater processor utilization.
Keywords:
Sorting Parallel computing Computer science Overhead (engineering) Sorting algorithm Parallel algorithm Sorting network Factor (programming language) Constant (computer programming) Parallel processing Analysis of parallel algorithms Algorithm Operating system
Metrics
4
Cited By
0.57
FWCI (Field Weighted Citation Impact)
10
Refs
0.68
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Topics
Interconnection Networks and Systems
Physical Sciences → Computer Science → Computer Networks and Communications
Cellular Automata and Applications
Physical Sciences → Computer Science → Computational Theory and Mathematics
Algorithms and Data Compression
Physical Sciences → Computer Science → Artificial Intelligence
Related Documents
JOURNAL ARTICLE
Optimal sorting algorithms for parallel computers
Gérard M. BaudetStevenson, David
Journal: KiltHub Repository Year: 1989
JOURNAL ARTICLE
Optimal sorting algorithms for parallel computers
Gérard M. BaudetStevenson, David
Journal: KiltHub Repository Year: 1989
JOURNAL ARTICLE
Optimal Sorting Algorithms for Parallel Computers
Journal: IEEE Transactions on Computers Year: 1978 Vol: C-27 (1)Pages: 84-87
BOOK-CHAPTER
Parallel Sorting Algorithms
S. LakshmivarahanSudarshan DhallL. L. Miller
Advances in computers Year: 1984 Pages: 295-354