Cache-Oblivious Algorithms
Citations
364 citations
150 citations
138 citations
97 citations
86 citations
References
65 citations
61 citations
45 citations
"Cache-Oblivious Algorithms" refers methods in this paper
...Excellent surveys on cache-oblivious algorithms and data structures include [Arge et al. 2005; Brodal 2004; Demaine 2002]....
[...]
42 citations
41 citations
"Cache-Oblivious Algorithms" refers background or methods in this paper
...Finally, we present simulation results proving that optimal cache-oblivious algorithms satisfying the regularity condition are also optimal (in expectation) in the previously studied SUMH [5, 28] and HMM [1] models....
[...]
...It can also be shown [Prokop 1999] that cache-oblivious algorithms satisfying (14) are also optimal (in expectation) in the previously studied SUMH [Alpern et al. 1990; Vitter and Nodine 1993] and HMM [Aggarwal et al. 1987a] models....
[...]
...Specifically, we prove (with only minor assumptions) that optimal cache-oblivious algorithms in the ideal-cache model are also optimal in the hierarchical memory model (HMM) [1] and in the serial uniform memory hierarchy (SUMH) model [5, 28]....
[...]
...Unlike previous cache-efficient distribution-sorting algorithms [1, 3, 21, 28, 30], which use sampling or other techniques to find the partitioning elements before the distribution step, our algorithm uses a “bucket splitting” technique to select pivots incrementally during the distribution....
[...]
...In the more restrictive SUMH model [28], however, only one bus is active at a time....
[...]