hesela.devInformed prefetching
Informed prefetching uses application disclosures of future file accesses to schedule advance reads under shared resource constraints.
Disclosure identifies future accesses in file-level terms rather than prescribing a lower-level policy. The historical TIP prototype could exploit nonsequential and cross-file access knowledge. [1]
TIP-2 balances buffers for advance reads, hinted reuse and unhinted LRU caching using estimated execution-time costs and benefits. The three demands compete for memory. [2]
Relations
Limitations
- Application hints describe expected accesses, not completed reads or guaranteed cache residency. [1]
Citations
- Patterson and Gibson. Exposing I/O Concurrency with Informed Prefetching. PDIS 1994, sections 1-2.
- Patterson et al. Informed Prefetching and Caching. SOSP 1995, sections 3-4 and 6-7.
Sources & caveats
- Historical primary-source review; the Mach 3.0 TIP prototype and OSF/1 TIP-2 evaluation are distinct systems, not current Linux implementations.