The Influence of Caches on the Performance of Sorting

DOI10.1006/JAGM.1998.0985MaRDI QIDQ4240128zbMATH OpenOpenAlexWikidataFDO

Authors Anthony LaMarca, Richard E. Ladner

Publication date 9 January 2000

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1998.0985

zbMATH Keywords

sorting algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Analysing cache effects in distribution sorting
• scientific article; zbMATH DE number 1445384
• Improving memory performance of sorting algorithms
• scientific article; zbMATH DE number 1670675
• Engineering a cache-oblivious sorting algorithm

Cited in

(15)

• Engineering a cache-oblivious sorting algorithm
• BlockQuicksort: avoiding branch mispredictions in Quicksort
• The cost of cache-oblivious searching
• Memory cache and lisp
• Improving memory performance of sorting algorithms
• High performance rearrangement and multiplication routines for sparse tensor arithmetic
• A blocked all-pairs shortest-paths algorithm
• Adapting Radix Sort to the Memory Hierarchy
• Analysing cache effects in distribution sorting
• Efficient sorting using registers and caches
• scientific article; zbMATH DE number 1670675 (Why is no real title available?)
• Irredundant intervals
• An experimental study of sorting and branch prediction
• Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme
• A fast algorithm for computing distance correlation

This page was built for publication: The Influence of Caches on the Performance of Sorting

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