Cache-Oblivious Algorithms
Citations
364 citations
150 citations
138 citations
97 citations
86 citations
References
119 citations
"Cache-Oblivious Algorithms" refers background or methods in this paper
...All previous cache-efficient distribution sort algorithms [1, 3, 30, 42, 44] are cache aware, since they are designed for caching models where the data is moved explicitly....
[...]
...Vitter and Shriver introduce paral lelism, and they give algorithms for matrix multiplication, FFT, sorting, and other problems in both a two-level model [43] and several parallel hierarchical mem ory models [44]....
[...]
...The basic algorithm is the well-known “six-step” variant [Bailey 1990; Vitter and Shriver 1994b] of the Cooley-Tukey FFT algorithm [Cooley and Tukey 1965]....
[...]
...Vitter and Shriver introduce parallelism, and they give algorithms for matrix multiplication, FFT, sorting, and other problems in both a two-level model [Vitter and Shriver 1994a] and several parallel hierarchical memory models [Vitter and Shriver 1994b]....
[...]
...The basic algorithm is the well-known “six-step” variant [6, 44] of the Cooley-Tukey FFT algorithm [15]....
[...]
113 citations
107 citations
102 citations
"Cache-Oblivious Algorithms" refers background or methods in this paper
...Unlike previous cache-efficient distribution-sorting algorithms [Aggarwal and Vitter 1988; Aggarwal et al. 1987a; Nodine and Vitter 1993; Vitter and Nodine 1993; Vitter and Shriver 1994b], which use sampling or other techniques to find the partitioning elements before the distribution step, our…...
[...]
...All previous cache-efficient distribution sort algorithms [1, 3, 30, 42, 44] are cache aware, since they are designed for caching models where the data is moved explicitly....
[...]
...Unlike previous cache-efficient distribution-sorting algorithms [1, 3, 30, 42, 44], which use sampling or other techniques to find the partitioning elements before the distribution step, our algorithm uses a “bucketsplitting” technique to select pivots incrementally during the distribution....
[...]
100 citations