Optimal Prediction for Prefetching in the Worst Case

DOI10.1137/S0097539794261817zbMath0911.68083OpenAlexW3137466223MaRDI QIDQ4210125

No author found.

Publication date: 21 September 1998

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539794261817

zbMATH Keywords

predictionresponse timecompetitive analysisprefetchingmachine learningcachingdatabasesoperating systemsfault ratehypertextfinite state prefetchers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Information storage and retrieval of data (68P20) Theory of operating systems (68N25)

Related Items (3)

Real-time integrated prefetching and caching ⋮ The power of amnesia: Learning probabilistic automata with variable memory length ⋮ Integrated prefetching and caching in single and parallel disk systems

This page was built for publication: Optimal Prediction for Prefetching in the Worst Case