Efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model
Citations
1 citations
References
1,344 citations
"Efficient cache oblivious algorithm..." refers methods in this paper
...REFERENCES [1] A. Aggarwal and J. S. Vitter....
[...]
...For the external memory model, Aggarwal and Vitter [1] designed a version of merge sort, that uses a maximum O( B logM/B N/B) I/O’s and this is optimal....
[...]
...1.1 Previous Related Work For the external memory model, Aggarwal and Vitter [1] designed a version of merge sort, that uses a maximum O( N logM/B N/B) I/O s and this is optimal....
[...]
1,202 citations
[...]
847 citations
"Efficient cache oblivious algorithm..." refers methods in this paper
...e and O(n B log Mn) cache misses 2. Note that both time and cache misses achieved by this algorithm are optimal. Arge et al. [4] formalized the PEM model and presented a merge sort algorithm based on [10] that runs in O(logn) time and has optimal cache misses. Note that their model is both cache aware and processor aware. This algorithm is very similar to merge sort implemented on [2]. They proved the...
[...]
...ssed above where O is used to represent expected bound.~ To sort nelements using pprocessors Model Time Cache cost Condition Source CRCW O(~ n p logn) np Reischuk [14] PRAM EREW O(n p logn) np Cole [10] PRAM Cache O( n p logn) O( BM B ) nB2p Goodrich [4] Aware MB2 Cache O(n p log 2 n) O( n B log ) nMp Ramachandran [5] Oblivious MB2 Cache Depth3 = O(log2 n) O(n B log M B n B ) M= (B2) Blelloch [7...
[...]
660 citations
604 citations
"Efficient cache oblivious algorithm..." refers methods in this paper
...[5] presented a sequential cacheoblivious sorting algorithm called Funnel sort which can sort n keys in O(n log n) time and O( n B logM n) cache misses....
[...]