Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
We take an important step forward in making Oblivious RAM (O-RAM) practical. We propose an O-RAM construction achieving an… Expand
  • table 1
  • table 2
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
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… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2007
Highly Cited
2007
A <b><i>streaming B-tree</i></b> is a dictionary that efficiently implements insertions and range queries. We present two cache… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
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… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Computers with multiple levels of caching have traditionally required techniques such as data blocking in order for algorithms to… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We propose a version of cache oblivious search trees which is simpler than the previous proposal of Bender, Demaine and Farach… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various… Expand
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This paper presents asymptotically optimal algorithms for rectangular matrix transpose, FFT, and sorting on computers with… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Software protection is one of the most important issues concerning computer practice. There exist many heuristics and ad-hoc… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Software protection is one of the most important issues concerning computer practice. There exist many heuristics and ad-hoc… Expand
Is this relevant?