Skip to search formSkip to main contentSkip to account menu

Cache-oblivious algorithm

Known as: Cache-oblivious, Cache oblivious model, Cache-oblivious model 
In computing, a cache-oblivious algorithm (or cache-transcendent algorithm) is an algorithm designed to take advantage of a CPU cache without having… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Standard cache-oblivious recursive divide-and-conquer algorithms for evaluating dynamic programming recurrences have optimal… 
2014
2014
Lower and upper bounds on the maximum priority inversion blocking (pi-blocking) that is generally unavoidable in distributed… 
2007
2007
Abstract The nonserial polyadic dynamic programming algorithm is one of the most fundamental algorithms for solving discrete… 
2007
2007
We consider the problem of two-dimensional outputsensitive convex hull in the cache-oblivious model. That is, we are interested… 
2006
2006
We present a study of implementations of DGEMM using both the cache-oblivious and cache-conscious programming styles. The cache… 
2006
2006
Partitioning has been used to improve the performance of the hash join in the main memory; however, cache-conscious partitioning… 
2005
2005
We present an efficient cache-oblivious implementation of the shortest-path algorithm for planar graphs by Klein et al., and… 
Highly Cited
2002
Highly Cited
2002
The cache oblivious model of computation is a two-level memory model with the assumption that the parameters of the model are…