A randomized parallel sorting algorithm with an experimental study

DOI10.1006/JPDC.1998.1462MaRDI QIDQ1268779zbMATH OpenOpenAlexFDO

Authors David R. Helman, David A. Bader, Joseph Ja'Ja'

Publication date 30 March 1999

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1903/835, http://digitalrepository.unm.edu/ece_rpts/7

zbMATH Keywords

load balancing

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An experimental analysis of parallel sorting algorithms
• Power balance and apportionment algorithms for the United States Congress
• Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
• An efficient parallel sorting algorithm for shared memory multiprocessors
• An efficient parallel sorting algorithm
• On the versatility of parallel sorting by regular sampling
• A benchmark parallel sort for shared memory multiprocessors
• Parallel sorting revisited
• scientific article; zbMATH DE number 4074508
• An optimal parallel adaptive sorting algorithm

Cited in

(10)

• Simple randomized mergesort on parallel disks
• Peculiarities of the parallel sorting algorithm with rank formation
• A randomized sorting algorithm on the BSP model
• An efficient parallel sorting compatible with the standard qsort
• Increasing the Efficiency of Existing Sorting Algorithms by Using Randomized Wrappers
• Robust massively parallel sorting
• Power balance and apportionment algorithms for the United States Congress
• Super scalar sample sort
• Fast sort of floating-point data for data engineering
• Advanced Model of Parallel Sorting Algorithm with Ranking

This page was built for publication: A randomized parallel sorting algorithm with an experimental study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1268779)