Optimal Prediction for Prefetching in the Worst Case

DOI10.1137/S0097539794261817zbMATH Open0911.68083OpenAlexW3137466223MaRDI QIDQ4210125FDOQ4210125

Authors:

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

Recommendations

• scientific article; zbMATH DE number 1003271
• Optimal prefetching via data compression
• Competitive Parallel Disk Prefetching and Buffer Management

zbMATH Keywords

predictionmachine learningresponse timecompetitive analysisdatabasescachingprefetchingoperating systemsfault ratehypertextfinite state prefetchers

Mathematics Subject Classification ID

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

Cited In (10)

• Real-time integrated prefetching and caching
• Interleaved prefetching
• {\textsc{FastSlim}}: prefetch-safe trace reduction for I/O cache simulation
• Title not available (Why is that?)
• Multi-stream \((Q,r)\) model and optimization for data prefetching
• The power of amnesia: Learning probabilistic automata with variable memory length
• Adaptive control of pre-fetching
• Title not available (Why is that?)
• Integrated prefetching and caching in single and parallel disk systems
• On Broadcast Disk Paging

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210125)