A New Method for Computing Page-Fault Rates

DOI10.1137/0222079MaRDI QIDQ4277546zbMATH OpenOpenAlexFDO

Authors Jiang-Hsing Chu, G. D. Knott

Publication date 13 November 1994

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

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

zbMATH Keywords

cachingorder-\(k\) programspage-fault rateregular expressions

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)

Recommendations

• On paging with locality of reference
• A unified analysis of paging and caching
• scientific article; zbMATH DE number 1943112
• On adequate performance measures for paging
• Markov Paging

Cited in

(2)

• A fluid limit for a cache algorithm with general request processes
• LUMPABILITY IN LRU STACK WITH MARKOVIAN PAGE REFERENCES

This page was built for publication: A New Method for Computing Page-Fault Rates

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