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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

Standard cache-oblivious recursive divide-and-conquer algorithms for evaluating dynamic programming recurrences have optimal…

2014

Lower and upper bounds on the maximum priority inversion blocking (pi-blocking) that is generally unavoidable in distributed…

2013

Oblivious transfer is one of the most basic and important building blocks in cryptography. As such, understanding its cost is of…

2008

We present an optimal cache-oblivious algorithm for finding all intersections between a set of non-intersecting red segments and…

2007

Abstract The nonserial polyadic dynamic programming algorithm is one of the most fundamental algorithms for solving discrete…

2005

We present an efficient cache-oblivious implementation of the shortest-path algorithm for planar graphs by Klein et al., and…

2005

2005

We present the first cache-oblivious data structure for planar orthogonal range counting, and improve on previous results for…

2004

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…