An efficient general in-place parallel sorting scheme

DOI10.1023/A:1008173729055zbMATH Open0952.68161OpenAlexW1508354858MaRDI QIDQ1964342FDOQ1964342

Authors: Yanyan Li 

Publication date: 7 June 2000

Published in: The Journal of Supercomputing (Search for Journal in Brave)

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

Recommendations

• Parallel sorting by regular sampling
• On the versatility of parallel sorting by regular sampling
• An experimental analysis of parallel sorting algorithms
• scientific article; zbMATH DE number 1760033
• Parallel sorting revisited

zbMATH Keywords

parallel sorting scheme

Mathematics Subject Classification ID

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

Cited In (4)

• Fast stable in-place sorting with \(O(n)\) data moves
• A note on adaptive parallel sorting
• Title not available (Why is that?)
• Efficient sorting using registers and caches

This page was built for publication: An efficient general in-place parallel sorting scheme

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