Distribution sort with randomized cycling

DOI10.1145/1162349.1162352MaRDI QIDQ3546317zbMATH OpenOpenAlexFDO

Authors David A. Hutchinson, Jeffrey Scott Vitter

Publication date 21 December 2008

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1162349.1162352

zbMATH Keywords

distributionexternal memoryexternal sortinginput/outputmergingmultipass algorithmsmultiple disksparallel disksrandomizationsorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Information storage and retrieval of data (68P20) Randomized algorithms (68W20)

Recommendations

• Distribution sort with randomized cycling
• scientific article; zbMATH DE number 1241382
• Reconciling simplicity and realism in parallel disk models
• Simple randomized mergesort on parallel disks
• scientific article; zbMATH DE number 1445386

Cited in

(7)

• Fast concurrent access to parallel disks
• Reconciling simplicity and realism in parallel disk models
• Distribution sort with randomized cycling
• On the midpath tree conjecture: A counter-example
• scientific article; zbMATH DE number 1241382 (Why is no real title available?)
• scientific article; zbMATH DE number 1445386 (Why is no real title available?)
• Algorithms – ESA 2005

This page was built for publication: Distribution sort with randomized cycling

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