Improving memory performance of sorting algorithms

DOI10.1145/351827.384245MaRDI QIDQ5463397zbMATH OpenOpenAlexFDO

Authors Stefan A. Kubricht, Li Xiao, Xiaodong Zhang

Publication date 4 August 2005

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

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

zbMATH Keywords

CachesMemory PerformanceMergesortQuicksortTLB

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• The Influence of Caches on the Performance of Sorting
• Large-scale sorting in uniform memory hierarchies
• Efficient sorting using registers and caches
• Adapting Radix Sort to the Memory Hierarchy
• scientific article; zbMATH DE number 1445384

Cited in

(4)

• Dynamic geometric data structures via shallow cuttings
• The Influence of Caches on the Performance of Sorting
• Efficient sorting using registers and caches
• A blocked all-pairs shortest-paths algorithm

Describes a project that uses

Uses Software

• ATLAS

This page was built for publication: Improving memory performance of sorting algorithms

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