Parallelizing merge sort onto distributed memory parallel computers

DOI10.1007/3-540-47847-7_5MaRDI QIDQ4738675zbMATH OpenFDO

Authors Minsoo Jeon, Dongseung Kim

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2327/23270025.htm

zbMATH Keywords

mergesort

Mathematics Subject Classification ID

Searching and sorting (68P10) Computing methodologies and applications (68U99) Distributed algorithms (68W15)

Recommendations

• Parallel merge sort with load balancing
• Parallel Merge Sort
• An efficient parallel sorting algorithm for shared memory multiprocessors
• An efficient parallel sorting algorithm
• Perfectly load-balanced, stable, synchronization-free parallel merge

Cited in

(7)

• Simple randomized mergesort on parallel disks
• Parallel merge sort with load balancing
• scientific article; zbMATH DE number 6117286 (Why is no real title available?)
• Parallel Sorting with Serial Memories
• A Pictorial Description of Cole’s Parallel Merge Sort
• On parallel integer merging
• Optimal parallel merging and sorting algorithms using \(\sqrt{N}\) processors without memory contention

This page was built for publication: Parallelizing merge sort onto distributed memory parallel computers

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