Overlapping computations, communications and I/O in parallel sorting

DOI10.1006/JPDC.1995.1097MaRDI QIDQ1898182zbMATH OpenOpenAlexFDO

Authors Mark J. Clement, Michael J. Quinn

Publication date 1 November 1995

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

Full work available at URL https://doi.org/10.1006/jpdc.1995.1097

zbMATH Keywords

distributed memorysorting algorithmparallel sorting algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)

Recommendations

• Parallel sorting by regular sampling
• Parallel sorting revisited
• An efficient parallel sorting algorithm for shared memory multiprocessors
• Parallel Sorting with Serial Memories
• An experimental analysis of parallel sorting algorithms

Cited in

(4)

• scientific article; zbMATH DE number 1196808 (Why is no real title available?)
• I/O-efficient well-separated pair decomposition and applications
• scientific article; zbMATH DE number 1256741 (Why is no real title available?)
• Parallel sorting with cooperating heaps in a linear array of processors

This page was built for publication: Overlapping computations, communications and I/O in parallel sorting

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