Cache-oblivious algorithms

The Worst Page-Replacement Policy

“…When reservoir MRU has fast-memory size k on and the offline strategy has fast-memory size (1 + 1/c)k on , reservoir MRU is (c + 1)-competitive. 5 Reservoir MRU requires some additional state-in particular, we need one bit per page to indicate whether the page has been requested before. Consequently, if the sequence requests n distinct pages, then we need O(n) extra bits of state.…”

Cache-Oblivious Red-Blue Line Segment Intersection

“…Thus, it is important to design algorithms that are sensitive to the architecture of the memory system and have a high degree of locality in their memory access patterns. Building on the two-level external-memory model [1] introduced to model the large difference between the access times of main memory and disk, the cacheoblivious model [8] was introduced as a way of obtaining algorithms that are efficient on all levels of arbitrary memory hierarchies. In this paper, we develop a cache-oblivious algorithm for the red-blue line segment intersection problem, that is, for finding all intersections between a set of non-intersecting red segments and a set of non-intersecting blue segments in the plane.…”

“…Cache-oblivious model. In the cache-oblivious model [8], the idea is to design a standard RAM-model algorithm that has not knowledge of the parameters of the memory hierarchy but analyze it in the external-memory model assuming that an offline optimal paging strategy performs the memory transfers necessary to bring accessed elements into memory. Often it is also assumed that M ≥ B 2 (the tall-cache assumption).…”

Translating submachine locality into locality of reference

“…Also, a two-level memory organization is featured by the External Memory (EM) model [3,20], which has been extensively used in the literature to develop I/O-efficient algorithms. Finally, the cache models defined in [15,16] have been at the base of the vast literature on cache-efficient algorithms.…”