Some Results on Distribution-Free Analysis of Paging Algorithms

DOI10.1109/TC.1976.1674682MaRDI QIDQ4101436zbMATH OpenFDO

Authors O. I. Aven, L. B. Boguslavskij, Ya. A. Kogan

Publication date 1976

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.1976.1674682

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) General topics in the theory of software (68N01) Formal languages and automata (68Q45)

Cited in

(3)

• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Transient and steady-state regime of a family of list-based cache replacement algorithms
• scientific article; zbMATH DE number 3787795 (Why is no real title available?)

This page was built for publication: Some Results on Distribution-Free Analysis of Paging Algorithms

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