Parallel merge sort with load balancing

DOI10.1023/A:1021734202931MaRDI QIDQ1394776zbMATH OpenOpenAlexFDO

Authors Minsoo Jeon, Dongseung Kim

Publication date 25 June 2003

Published in International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1021734202931

zbMATH Keywords

parallel algorithmmerge sortload balancingsplitter

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 2087747
• An efficient parallel sorting algorithm for shared memory multiprocessors
• A parallel sorting-merging algorithm for tightly coupled multiprocessors
• Perfectly load-balanced, stable, synchronization-free parallel merge
• Parallel sorting by regular sampling

Cited in

(5)

• Producing proofs of unsatisfiability with distributed clause-sharing SAT solvers
• An efficient parallel sorting compatible with the standard qsort
• Fast sort of floating-point data for data engineering
• A parallel partition for enhanced parallel QuickSort
• scientific article; zbMATH DE number 2087747 (Why is no real title available?)

This page was built for publication: Parallel merge sort with load balancing

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