Advertisement

Optimal constant space move-to-fear list organization

  • B. John Oommen
  • David T. H. Ng
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 401)

Abstract

We consider the problem of adaptively organizing a list whose elements are accessed with a fixed but unknown probability distribution. We present a strategy which has constant additional space requirements and which achieves the reorganization by performing a data restructuring operation on an element exactly once. The scheme, which is stochastically absorbing, and is of a Move-to-Rear flavour is shown to be asymptotically optimal. In other words, by suitably performing the Move-to-Rear operation the probability of converging to the optimal arrangement can be made as close to unity as desired. Considering all of these features, this strategy is probably the most ideal list organization strategy reported in the literature. Simulation results demonstrating the power of the scheme have been included. The paper also includes a hybrid data reorganization scheme in which an absorbing Move-To-Rear rule and an ergodic rule are used in conjunction with each other.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Arnow, D.M. and Tenebaum, A.M., "An Investigation of the Move-Ahead-k Rules", Congressus Numerantium, Proc. of the Thirteenth Southeastern Conference on Combinatorics, Graph Theory and Computing, Florida, February 1982, pp. 47–65.Google Scholar
  2. [2]
    Bitner, J.R., "Heuristics That Dynamically Organize Data Structures", SIAM J. Comput., Vol.8, 1979, pp. 82–110.CrossRefGoogle Scholar
  3. [3]
    Burville, P.J. and Kingman, J.F.C., "On a Model for Storage and Search", J. Appl. Probability, Vol.10, 1973, pp. 697–701.Google Scholar
  4. [4]
    Gonnet, G.H., Munro, J.I. and Suwanda, H., "Exegesis of Self Organizing Linear Search", SIAM J. Comput., Vol.10, 1981, pp.613–637.CrossRefGoogle Scholar
  5. [5]
    Hendricks, W.J., "An Extension of a Theorem Concerning an Interesting Markov Chain", J. App. Probability, Vol.10, 1973, pp.231–233.Google Scholar
  6. [6]
    Hester, J.H. and Hirschberg, D.S., "Self-Organizing Linear Search", ACM Computing Surveys, Vol. 17, 1985, pp.295–311.CrossRefGoogle Scholar
  7. [7]
    Kan, Y.C. and Ross, S.M., "Optimal List Order Under Partial Memory Constraints", J. App. Probability, Vol.17, 1980, pp. 1004–1015.Google Scholar
  8. [8]
    Isaacson, D.L. and Madsen, R.W., "Markov Chains: Theory and Applications" New York, John Wiley & Son, 1976.Google Scholar
  9. [9]
    Knuth, D.E., "The Art of Computer Programming, Vol.3, Sorting and Searching", Addison-Wesley, Reading, MA., 1973.Google Scholar
  10. [10]
    McCabe, J., "On Serial Files With Relocatable Records", Operations Research, Vol.12, 1965, pp.609–618.Google Scholar
  11. [11]
    Oommen, B.J. and Hansen, E.R., "List Organizing Strategies Using Stochastic Move-to-front and Stochastic Move-to-Rear Operations", to appear in SIAM Journal on Computing. Vol. 16, (1987), 705–716.Google Scholar
  12. [12]
    Oommen, B.J., Hansen, E.R. and Munro, J.I., "Deterministic Optimal and Expedient Move-To-Rear List Organizing Strategies", to appear in Theoretical Computer Science (Preliminary abridged version was published in the Proc. of the 25th Annual Allerton Conference, Urbana, Illinois, Sept/Oct. 1987, pp.54–63).Google Scholar
  13. [13]
    Rivest, R.L., "On Self-Organizing Sequential Search Heuristics", Comm. ACM, Vol.19, 1976, pp.63–67.CrossRefGoogle Scholar
  14. [14]
    Sleator, D. and Tarjan, R., "Amortized Efficiency of List Update Rules", Proc. of the Sixteenth Annual ACM Symposium on Theory of Computing, April 1984, pp. 488–492.Google Scholar
  15. [15]
    Tenenbaum, A.M. and Nemes, R.M., "Two Spectra of Self-Organizing Sequential Search Algorithms", SIAM J. Comput., Vol.11, 1982, pp-557–566.CrossRefGoogle Scholar
  16. [16]
    Oommen, B.J., Ng, D.T.H., "Ideal List Organization for Stationary Environments", Submitted for publication. Also available as a Technical Report from the School of Computer Science, Carleton University, Ottawa K1S 5B6, CANADA.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • B. John Oommen
    • 1
  • David T. H. Ng
    • 1
  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada

Personalised recommendations