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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1999-2018
05101519992018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
In this paper we explore a simple and general approach for developing parallel algorithms that lead to good cache complexity on… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
The nonserial polyadic dynamic programming algorithm is one of the most fundamental algorithms for solving discrete optimization… (More)
  • figure 2
  • table 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally <ul><li… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We present a cache oblivious algorithm for stencil computations, which arise for example in finite-difference methods. Our… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We propose a version of cache oblivious search trees which is simpler than the previous proposal of Bender, Demaine and Farach… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2002
2002
The cache oblivious model is a simple and elegant model to design algorithms that perform well in hierarchical memory models… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
A recent direction in the design of cache-efficient and diskefficient algorithms and data structures is the notion of cache… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
(MATH) In this paper we develop an optimal cache-oblivious priority queue data structure, supporting insertion, deletion, and… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This article presents asymptotically optimal algorithms for rectangular matrix transpose, fast Fourier transform (FFT), and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1999
1999
This thesis presents “cache-oblivious” algorithms that use asymptotically optimal amounts of work, and move data asymptotically… (More)
  • figure 1-1
  • figure 2-1
  • figure 4-1
  • figure 6-2
  • figure 6-4
Is this relevant?