Skip to main content Accessibility help

Cost comparison of a spectrum of self-organizing rules

  • K. S. Chong (a1) and K. Lam (a1)


Consider the following self-organizing rule called POS(i): after a book in the jth position of a shelf is borrowed, it is moved up one position if j i, and is moved to the ith position if j > i. This is a family of move-forward rules, with POS(l) being the move-to-front rule and POS(n − 1) being the transposition rule where n is the number of books to be organized. We derive explicitly the stationary distribution under the POS(i) rule and show that its search cost compares favorably with that of move-to-front rule under any book access probabilities p 1, p 1, ···, pn .


Corresponding author

Postal address: Statistics Department, The University of Hong Kong, Hong Kong.


Hide All

The research of K. Lam is partially supported by a research grant from the University of Hong Kong.



Hide All
Anderson, E. J., Nash, P. and Weber, R. R. (1982) A counterexample to a conjecture on optimal list ordering. J. Appl. Prob. 19, 730732.
Bitner, J. R. (1979) Heuristics that dynamically organize data structures. SIAM J. Comput. 8, 82110.
Hendricks, W. J. (1976) An account of self-organizing systems. SIAM J. Comput. 5, 715723.
Kan, Y. C. and Ross, S. M. (1980) Optimal list order under partial memory constraints. J. Appl. Prob. 17, 10041015.
Lam, K. (1984) Comparison of self-organizing linear search rules. J. Appl. Prob. 21, 763776.
Lam, K. and Cowan, R. (1992) Stochastic reversibility in self-organizing systems. Commun. Statist.-Stoch Models 8, 325336.
Lam, K., Leung, M. Y. and Siu, M. K. (1984) Self-organizing files with dependent accesses. J. Appl. Prob. 21, 343359.
Lam, K., Siu, M. K. and Yu, C. T. (1981) A generalized counter scheme. Theoret. Comput. Sci. 16, 271278.
Nelson, P. R. (1982) The transposition replacement policy with a partial memory. J. Appl. Prob. 19, 733736.
Phatarfod, R. M. (1994) On the transition probabilities of the move-to-front scheme. J. Appl. Prob. 31, 570574.
Rivest, R. (1976) On self-organizing sequential search heuristics. Commun. ACM 19, 6367.
Tenenbaum, A. M. and Nemes, R. M. (1982) Two spectra of self-organizing sequential search algorithms. SIAM J. Comput. 11, 557566.


MSC classification

Cost comparison of a spectrum of self-organizing rules

  • K. S. Chong (a1) and K. Lam (a1)


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed