Some Results on Distribution-Free Analysis of Paging Algorithms

DOI10.1109/TC.1976.1674682zbMATH Open0334.68035MaRDI QIDQ4101436FDOQ4101436

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

Publication date: 1976

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

Mathematics Subject Classification ID

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

Cited In (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
• Title not available (Why is that?)

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)