Cache-Oblivious Algorithms Export

@misc{citeulike:2045593, abstract = {This thesis presents \"cache-oblivious\" algorithms that use asymptotically optimal amounts of work, and move data asymptotically optimally among multiple levels of cache. An algorithm is cache oblivious if no program variables dependent on hardware configuration parameters, such as cache size and cache-line length need to be tuned to minimize the number of cache misses. We show that the ordinary algorithms for matrix transposition, matrix multiplication, sorting, and Jacobi-style multipass...}, author = {Prokop, H.}, citeulike-article-id = {2045593}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.5650}, keywords = {algorithms, cache, cache\_oblivious}, month = {June}, posted-at = {2007-12-02 19:27:25}, priority = {2}, title = {Cache-Oblivious Algorithms}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.5650}, year = {1999} }

TY - GEN ID - citeulike:2045593 L3 - citeulike-article-id:2045593 N2 - This thesis presents "cache-oblivious" algorithms that use asymptotically optimal amounts of work, and move data asymptotically optimally among multiple levels of cache. An algorithm is cache oblivious if no program variables dependent on hardware configuration parameters, such as cache size and cache-line length need to be tuned to minimize the number of cache misses. We show that the ordinary algorithms for matrix transposition, matrix multiplication, sorting, and Jacobi-style multipass... TI - Cache-Oblivious Algorithms KW - algorithms KW - cache KW - cache_oblivious AU - Prokop, H PY - 1999/June// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.5650 ER -