table-based-prefetching · research · also TaP

Table-based Prefetching (TaP)

TaP is a research storage-prefetching scheme that separates address-history tracking from cached payloads.

Table entries detect interleaved sequential streams and record unused prefetch evictions. A later hit on a marked entry increases the prefetch-cache allocation; a stable recent hit rate permits gradual contraction. [1]

Relations

related
Prefetch wastage, Prefetch trigger distance, Ghost cache entry, readahead (Linux syscall)

Limitations

  • Its simulation evidence does not establish present-day Linux behavior or SSD performance. [1]

Citations

  1. Mingju Li, Elizabeth Varki, Swapnil Bhatia and Arif Merchant. TaP: Table-based Prefetching for Storage Caches. FAST 2008, pp. 81-96; sections 3-4. (accessed 2026-11-09)

Further reading

  1. Hesela: address history, payload residency and prefetch diagnostics (accessed 2026-11-09)
Sources & caveats
  • Primary-source synthesis, not a replication. No upstream implementation or figures are redistributed.

JSON: /data/terms/table-based-prefetching.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. Table-based Prefetching (TaP). Hesela. 2026-11-09. https://hesela.dev/terms/table-based-prefetching/