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)

Related topics

Related topics

28 relations
ALGLIBAbstract machineAlgorithmAmortized analysis

Broader (1)

Analysis of algorithms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
POSTER: Provably Efficient Scheduling of Cache-Oblivious Wavefront Algorithms
Standard cache-oblivious recursive divide-and-conquer algorithms for evaluating dynamic programming recurrences have optimal… 
2014
2014
Blocking Optimality in Distributed Real-Time Locking Protocols
Lower and upper bounds on the maximum priority inversion blocking (pi-blocking) that is generally unavoidable in distributed… 
2013
2013
Cache and I/O efficent functional algorithms
The widely studied I/O and ideal-cache models were developed to account for the large difference in costs to access memory at… 
2007
2007
Cache oblivious algorithms for nonserial polyadic programming
Abstract The nonserial polyadic dynamic programming algorithm is one of the most fundamental algorithms for solving discrete… 
2006
2006
Is Cache-Oblivious DGEMM Viable?
We present a study of implementations of DGEMM using both the cache-oblivious and cache-conscious programming styles. The cache… 
2005
2005
Cache-Oblivious Planar Shortest Paths
We present an efficient cache-oblivious implementation of the shortest-path algorithm for planar graphs by Klein et al., and… 
2005
2005
Oblivious Medians via Online Bidding
Highly Cited
2002
Highly Cited
2002
Funnel Heap - A Cache Oblivious Priority Queue
The cache oblivious model of computation is a two-level memory model with the assumption that the parameters of the model are… 
2002
2002
A robust DWT-based blind data hiding algorithm
The watermark embedding strategy is one of factors that affect the robustness of the watermark. In this paper, a new embedding… 
1991
1991
Scheduling pipelined communication in distributed memory multiprocessors for real-time applications
This paper investigates communication in distributed memory multiprocessors to support tasklevel parallelism for real-time… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)