computing, a cache-oblivious algorithm (or cache-transcendent algorithm) is an algorithm designed to take advantage of a processor cache without having...
13 KB (1,843 words) - 05:14, 3 November 2024
computing, cache replacement policies (also known as cache replacement algorithms or cache algorithms) are optimizing instructions or algorithms which a...
38 KB (4,883 words) - 21:33, 6 June 2025
environment where cache sizes are effectively dynamic due to other processes taking up cache space. (The simple iterative algorithm is cache-oblivious as well,...
39 KB (4,483 words) - 22:23, 1 June 2025
algorithms appears in 1971. Cache-oblivious algorithm External memory graph traversal Online algorithm Parallel external memory Streaming algorithm Vitter...
9 KB (1,031 words) - 21:20, 19 January 2025
Loop nest optimization (redirect from Cache blocking)
size based on these factors. By contrast, cache-oblivious algorithms are designed to make efficient use of cache without explicit blocking. Many large mathematical...
16 KB (2,369 words) - 17:19, 29 August 2024
The cache-oblivious distribution sort is a comparison-based sorting algorithm. It is similar to quicksort, but it is a cache-oblivious algorithm, designed...
6 KB (966 words) - 11:50, 19 December 2024
within the cache, without accessing the slower main memory. An algorithm designed to exploit the cache in this way is called cache-oblivious, because it...
21 KB (2,894 words) - 09:50, 14 May 2025
perspective of neighboring layers. Cache coloring Cache hierarchy Cache-oblivious algorithm Cache stampede Cache language model Cache manifest in HTML5 Dirty bit...
30 KB (4,140 words) - 19:28, 12 June 2025
or out-of-core operation, and was later shown to be an optimal cache-oblivious algorithm. The general Cooley–Tukey factorization rewrites the indices k...
36 KB (5,348 words) - 13:38, 23 May 2025
the recursive step in the algorithm shown.) Strassen's algorithm is cache oblivious. Analysis of its cache behavior algorithm has shown it to incur Θ (...
26 KB (3,597 words) - 23:26, 31 May 2025
Fast Fourier transform (redirect from FFT algorithm)
along the n1 direction. More generally, an asymptotically optimal cache-oblivious algorithm consists of recursively dividing the dimensions into two groups...
67 KB (7,809 words) - 07:25, 21 June 2025
Longest common subsequence (redirect from Difference Algorithm)
Harald; Ramachandran, Sridhar (January 2012). "Cache-oblivious algorithms". ACM Transactions on Algorithms. 8 (1): 1–22. doi:10.1145/2071379.2071383. Apostolico...
35 KB (4,355 words) - 22:13, 6 April 2025
Velocity/AppFabric Cache algorithms Cache coherence Cache-oblivious algorithm Cache stampede Cache language model Database cache Cache manifest in HTML5...
3 KB (354 words) - 15:23, 28 May 2025
Funnelsort (category Cache (computing))
Funnelsort is a comparison-based sorting algorithm. It is similar to mergesort, but it is a cache-oblivious algorithm, designed for a setting where the number...
8 KB (1,427 words) - 03:39, 31 July 2024
Charles E. Leiserson (section VLSI and caching methods)
of cache-oblivious algorithms, which are algorithms that have no tuning parameters for cache size or cache-line length, but nevertheless use cache near-optimally...
8 KB (821 words) - 18:00, 1 May 2025
An Oblivious RAM (ORAM) simulator is a compiler that transforms an algorithm in such a way that the resulting algorithm preserves the input-output behavior...
38 KB (3,993 words) - 05:17, 16 August 2024
Engineering and is also known for having elucidated the concept of the cache-oblivious algorithm. "Harald Prokop". Retrieved December 8, 2010. v t e v t e...
1 KB (60 words) - 20:58, 10 December 2023
domain name record in question. Typically, such caching DNS servers also implement the recursive algorithm necessary to resolve a given name starting with...
69 KB (9,812 words) - 13:55, 15 June 2025
desired. Chowdhury, Le, and Ramachandran later optimized the cache performance of the algorithm while keeping the space usage linear in the total length of...
36 KB (4,666 words) - 20:40, 19 June 2025
which are efficient in computers using virtual memory or caches, such as cache-oblivious algorithms, k-heaps, and van Emde Boas layouts. Traditionally, binary...
6 KB (893 words) - 18:04, 27 January 2025
In-place matrix transposition (section Algorithms)
function-call overhead.) This is a cache-oblivious algorithm, in the sense that it can exploit the cache line without the cache-line size being an explicit parameter...
22 KB (3,044 words) - 20:41, 19 March 2025
Locality of reference (redirect from Cache locality)
hierarchy together. Computer programming portal Cache-oblivious algorithm Communication-avoiding algorithm File system fragmentation Partitioned global address...
16 KB (2,329 words) - 01:30, 30 May 2025
Bender is an American computer scientist, known for his work in cache-oblivious algorithms, lowest common ancestor data structures, scheduling (computing)...
6 KB (451 words) - 22:15, 17 June 2025
computations. Cache-oblivious algorithms represent a different approach introduced in 1999 for fast Fourier transforms, and then extended to graph algorithms, dynamic...
13 KB (1,680 words) - 00:20, 20 June 2025
Journal of Algorithms, 14 (3): 344–370, CiteSeerX 10.1.1.55.5669, doi:10.1006/jagm.1993.1018 Harald Prokop. Cache-Oblivious Algorithms. Masters thesis...
2 KB (202 words) - 03:28, 31 July 2024
for his work in streaming algorithms, suffix tree construction, pattern matching in compressed data, cache-oblivious algorithms, and lowest common ancestor...
12 KB (953 words) - 15:30, 9 May 2025
B-tree (section Algorithms)
of Algorithms and Data Structures: B-tree B-Tree Tutorial The InfinityDB BTree implementation Cache Oblivious B(+)-trees Dictionary of Algorithms and...
53 KB (7,338 words) - 14:52, 20 June 2025
Ski rental problem (category Online algorithms)
the randomized ski-rental coin flipping algorithm is 1.8. The best randomized algorithm against an oblivious adversary is to choose some day i at random...
10 KB (1,822 words) - 19:53, 26 February 2025
External sorting (category Sorting algorithms)
running time of an algorithm is determined by the number of memory transfers between internal and external memory. Like their cache-oblivious counterparts,...
14 KB (2,176 words) - 17:38, 4 May 2025
Edit distance (redirect from Levenshtein algorithm)
Chowdhury, Rezaul; Le, Hai-Son; Ramachandran, Vijaya (July 2010). "Cache-oblivious dynamic programming for bioinformatics". IEEE/ACM Transactions on Computational...
19 KB (2,449 words) - 07:20, 17 June 2025