On a model for storage and search

DOI10.2307/3212792zbMath0281.60074OpenAlexW1978390677MaRDI QIDQ4766354

P. J. Burville, J. F. C. Kingman

Publication date: 1973

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

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

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items (22)

Fair service for mice in the presence of elephants ⋮ Off-line algorithms for the list update problem ⋮ Self-organizing sequential search and Hilbert's inequalities ⋮ An exact formula for the move-to-front rule for self-organizing lists ⋮ A competitive analysis of the list update problem with lookahead ⋮ List update with probabilistic locality of reference ⋮ A generalized counter scheme ⋮ Limiting distributions of generalised Poisson-Dirichlet distributions based on negative binomial processes ⋮ Deterministic optimal and expedient move-to-rear list organizing strategies ⋮ Performance of the move-to-front algorithm with Markov-modulated request sequences ⋮ Stochastic ranking process with time dependent intensities ⋮ Least-recently-used caching with dependent requests ⋮ SIZE-BIASED PERMUTATION OF DIRICHLET PARTITIONS AND SEARCH-COST DISTRIBUTION ⋮ Analysis of storage hierarchy ⋮ Self-organizing doubly linked lists^† ⋮ Unnamed Item ⋮ A fluid limit for a cache algorithm with general request processes ⋮ On Optimal Performance in Self-Organizing Paging Algorithams ⋮ Multiplicities of eigenvalues of some linear search schemes ⋮ Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities ⋮ Randomized competitive algorithms for the list update problem ⋮ On lookahead in the list update problem

This page was built for publication: On a model for storage and search