Large-scale sorting in uniform memory hierarchies

DOI10.1006/JPDC.1993.1008MaRDI QIDQ1803300zbMATH OpenOpenAlexFDO

Authors Jeffrey Scott Vitter, Mark H. Nodine

Publication date 29 June 1993

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

Full work available at URL http://hdl.handle.net/1808/7211

zbMATH Keywords

blockscachecommunication bandwidthmemory hierarchymultilevelparallel computation

Mathematics Subject Classification ID

Searching and sorting (68P10) Theory of data (68P99) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 176491
• scientific article; zbMATH DE number 1792107
• Algorithms for parallel memory. II: Hierarchical multilevel memories
• Algorithms for parallel memory, I: Two-level memories

Cited in

(9)

• Markov analysis of multiple-disk prefetching strategies for external merging
• Algorithms for parallel memory. II: Hierarchical multilevel memories
• Random permutations on distributed, external and hierarchical memory
• scientific article; zbMATH DE number 4211488 (Why is no real title available?)
• Sorting and searching in the presence of memory faults (without redundancy)
• scientific article; zbMATH DE number 176491 (Why is no real title available?)
• Hierarchical bin buffering
• Improving memory performance of sorting algorithms
• Efficient sorting using registers and caches

This page was built for publication: Large-scale sorting in uniform memory hierarchies

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