Low depth cache-oblivious algorithms
Citations
20 citations
Cites methods from "Low depth cache-oblivious algorithm..."
...There have been various techniques proposed to address these algorithmic changes, either using compiler assisted optimization [27], using cache-oblivious algorithms [6] or specialized languages like Sequoia [21]....
[...]
19 citations
Cites methods from "Low depth cache-oblivious algorithm..."
...this approach using parallel sample sort from the Problem Based Benchmark Suite (PBBS) [9, 53] due to its better cacheefficiency over parallel semisort....
[...]
...We implemented this approach using parallel sample sort from the Problem Based Benchmark Suite (PBBS) [9, 53] due to its better cacheefficiency over parallel semisort....
[...]
17 citations
17 citations
16 citations
References
3,885 citations
Additional excerpts
...7] and distributed memory machines [48, 33, 12]....
[...]
2,378 citations
"Low depth cache-oblivious algorithm..." refers background in this paper
...It follows from [47] that the number of cache misses at each level under the multi-level LRU policy is within a factor of two of the number of misses for a cache half the size running the optimal replacement policy....
[...]
1,688 citations
"Low depth cache-oblivious algorithm..." refers background in this paper
...A common form of programming in this model is based on nested parallelism—consisting of nested parallel loops and/or fork-join constructs [13, 26, 20, 35, 44]....
[...]
1,577 citations
Additional excerpts
...A basic strategy for list ranking [40] is the following: (i) shrink the list to size O(n/ log n), and (ii) apply pointer jumping on this shorter list....
[...]
1,515 citations