The performance of the move-to-front scheme under some particular forms of Markov requests

DOI10.2307/3215222zbMATH Open0839.60067OpenAlexW4254668340MaRDI QIDQ4866784FDOQ4866784

Authors: Eliane R. Rodrigues 

Publication date: 28 May 1996

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3215222

Recommendations

• scientific article; zbMATH DE number 970669
• On the move-to-front scheme with Markov dependent requests
• Performance of the move-to-front algorithm with Markov-modulated request sequences
• scientific article; zbMATH DE number 1270016
• Convergence to stationary state for a Markov move-to-front scheme

zbMATH Keywords

stationary distributionMarkov dependencemean search timevariance of the search time

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) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Searching and sorting (68P10)

Cited In (6)

• A fluid limit for a cache algorithm with general request processes
• Least-recently-used caching with dependent requests
• Performance of the move-to-front algorithm with Markov-modulated request sequences
• Optimality of move-to-front for self-organizing data structures with locality of references
• The move-to-root rule for self-organizing trees with Markov dependent requests^∗
• Convergence to stationary state for a Markov move-to-front scheme

This page was built for publication: The performance of the move-to-front scheme under some particular forms of Markov requests

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