Hostname: page-component-cd9895bd7-gvvz8 Total loading time: 0 Render date: 2024-12-27T22:30:30.511Z Has data issue: false hasContentIssue false
  • English
  • Français

On some multi-request move-to-front heuristics

Part of: Special processes

Published online by Cambridge University Press:  14 July 2016

R. M. Phatarfod  and
A. J. Pryde
R. M. Phatarfod*
Affiliation:
Monash University
A. J. Pryde*
Affiliation:
Monash University
*
∗Postal address: Department of Mathematics and Statistics, Monash University, Clayton, Victoria 3168, Australia.
∗Postal address: Department of Mathematics and Statistics, Monash University, Clayton, Victoria 3168, Australia.
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider the problem of self-organizing a linear list when the list is subjected to a random number of requests. Three separate move-to-front heuristics are considered. The difference between them lies in whether the items in the requested set are moved to the front in random order, or the same order as they were in originally, or in the order opposite to the one they were in originally. The eigenvalues of the transition probability matrices corresponding to the three heuristics are explicitly derived.

Keywords

Multi-request heuristicmove-to-fronteigenvalues

MSC classification

Primary: 60K35: Interacting random processes; statistical mechanics type models; percolation theory
Type
Research Papers
Information
Journal of Applied Probability , Volume 35 , Issue 4 , December 1998 , pp. 911 - 918
Copyright
Copyright © Applied Probability Trust 1998 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Cox, D. R., and Miller, H. D. (1965). The Theory of Stochastic Processes. Methuen, London.Google Scholar
Hendricks, W. J. (1976). An account of self-organizing systems. SIAM J. Computing 5, 710–723.Google Scholar
Moran, P. A. P. (1968). An Introduction to Probability Theory. Clarendon Press, Oxford.Google Scholar
Phatarfod, R. M. (1991). On the matrix occurring in a linear search problem. J. Appl. Prob. 28, 336–346.Google Scholar
Phatarfod, R. M., Pryde, A. J., and Dyte, D. (1997). On the move-to-front scheme with Markov dependent requests. J. Appl. Prob. 34, 790–794.Google Scholar
Valiveti, R. S., Oomanen, B. J., and Zgierski, J. R. (1995). Adaptive linear list reorganization under a generalized query system. J. Appl. Prob. 32, 793–804.Google Scholar