Advertisement

Generalizing singly-linked list reorganizing heuristics for doubly-linked lists

  • D. T. H. Ng
  • B. J. Oommen
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 379)

Abstract

The class of memoryless heuristics for maintaining a doubly-linked list in an approximately optimal order is studied. Initially the problem, its representation and the constraints on doubly linked lists are defined. Various mappings and theorems that relate singly-linked list and doubly linked list heuristics are presented, and a new heuristic referred to as the Swap heuristic for the doubly linked list is introduced. The Swap heuristic is shown to be more efficient than the Move-To-End heuristic.

Keywords

Directed Mapping List Structure Zipf Distribution Sequential List Stochastic Completeness 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Ande85]
    Anderson, E.J., Nash, P. and Weber, R.R., A counter-example to a conjecture on optimal list ordering, J. Appl. Probl. 19, 3 (Sept.1982), pp. 730–732.Google Scholar
  2. [Bitn79]
    Bitner, J.R., Heuristics that dynamically organize data structures, SIAM J. Comput. 8, 1 (Feb.1979), pp. 82–110.Google Scholar
  3. [Gonn79]
    Gonnet, G.H., Munro, J.I., and Suwanda, H., Toward self-organizing linear search, Proceedings of the 20th IEEE Symposium on Foundations of Computer Science (San Juan, Puerto Rico, Oct. 1979). IEEE, New York, pp.169–174.Google Scholar
  4. [Hest85]
    Hester J.H. and Hirschberg D.S., Self-organizing linear search, Comp. Surveys, Vol. 17, 3 (Sept.1985), pp. 295–311.Google Scholar
  5. [Hend72]
    Hendricks, W.J., The stationary distribution of an interesting Markov chain, J.Appl.Probl. 9, 1 (Mar.1972), pp. 231–233.Google Scholar
  6. [Kan80]
    Kan, Y.C. and Ross, S.M., Optimal list order partial memory constraints, J. Appl. Prob. 17, 4 (Dec.1980), pp. 1004–1015.Google Scholar
  7. [Knut73]
    Knuth, D.E., The art of computer programming, vol. 3: Sorting and Searching. Addison-Wesley, Reading, Mass.(1973), pp.398–399.Google Scholar
  8. [Matt80]
    Matthews, D., Self-organizing doubly linked lists, J.Comp. Maths., Sec.A, Vol.8 (1980), pp. 99–106.Google Scholar
  9. [McCa65]
    McCabe, J., On serial files with relocatable records, Oper. Res. (July./Aug. 65), 609–618.Google Scholar
  10. [Ng88]
    Ng, D.T.H. and Oommen, B.J., "On Doubly-Linked List Reorganizing Heuristics". Submitted for Publication. Also available as a technical report (SCS-TR-151) from the School of Computer Science, Carleton University, Ottawa, Canada: K1S 5B6.Google Scholar
  11. [Oomm87]
    Oommen, B.J., and Hansen, E.R., List organizing strategies using stochastic move-to-front and stochastic move-to-rear operations, SIAM Journal of Computing, Vol. 16, No.4, (Aug. 1987), pp 705–716.Google Scholar
  12. [Oomm88]
    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.Google Scholar
  13. [Rive76]
    Rivest, R., On self-organizing sequential search heuristics, Comm. CAM 19, 2 (Feb.1976), pp. 63–67.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • D. T. H. Ng
    • 1
  • B. J. Oommen
    • 1
  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada

Personalised recommendations