The Ideal Cache Model is a theoretical computational model in the study of cache-oblivious algorithms that belongs to the class of abstract machine models and is distinguished by its assumption of a fully associative cache with optimal replacement policy and a block size and cache size unknown to the algorithm.
8
Publications
489
Citations
11
Authors
10
Institutions
Publications per year
2017–2026
2
Variants
Ideal-cache Model
Publications
8
Cache oblivious stencil computations
Matteo Frigo, Volker Strumpen · 2005 · 185 citations
Effectively sharing a cache among threads
Guy E. Blelloch, Phillip B. Gibbons · 2004 · 83 citations
Sorting with Asymmetric Read and Write Costs
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons et al. · 2015 · 68 citations · Full text
Piyush Kumar · 2003 · 25 citations
1–5 of 8
Authors
11
- GE
3
h-index
- PB
2
h-index
- YG
1
h-index
- VS
1
h-index
- JS
1
h-index
1–5 of 11
Institutions
10
Carnegie Mellon University
Pittsburgh, United States
4 h-index
11 publications
437 citations
Intel (United States)
Santa Clara, United States
2 h-index
2 publications
151 citations
IBM (United States)
Armonk, United States
1 h-index
2 publications
370 citations
Utrecht University
Utrecht, The Netherlands
1 h-index
1 publications
86 citations
Stony Brook University
Stony Brook, United States
1 h-index
1 publications
25 citations
Intel (United Kingdom)
Swindon, United Kingdom
1 h-index
1 publications
83 citations
IBM Research - Austin
Austin, United States
1 h-index
2 publications
370 citations
State University of New York
Albany, United States
1 h-index
1 publications
25 citations
1–8 of 10
Venues
- DSpace@MIT (Massachusetts Institute of Technology)
Repository · 1 publications · 15 citations
1
h-index
- SIAM Journal on Scientific Computing
1 publications · 86 citations
1
h-index
1–2