Some Results on Distribution-Free Analysis of Paging Algorithms
From MaRDI portal
Publication:4101436
DOI10.1109/TC.1976.1674682zbMath0334.68035MaRDI QIDQ4101436
L. B. Boguslavskij, Ya. A. Kogan, O. I. Aven
Publication date: 1976
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Formal languages and automata (68Q45) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) General topics in the theory of software (68N01)
Related Items (3)
Transient and steady-state regime of a family of list-based cache replacement algorithms ⋮ Birthday paradox, coupon collectors, caching algorithms and self- organizing search ⋮ Unnamed Item
This page was built for publication: Some Results on Distribution-Free Analysis of Paging Algorithms
