Abstract
We study the problem of maintaining a doubly-linked list (DLL) in approximately optimal order, with respect to the mean search time. Move-To-End (MTE) [1]_and SWAP [2]_are two ergodic memoryless DLL heuristics obtained from natural extensions of the well known Singly-linked-list (SLL) heuristics Move-To-Front (MTF) and Transposition (TR) respectively. We first derive a general sufficient condition which permits comparison of any two DLL heuristics. We use this condition as a guideline to identify families of access distributions for which SWAP yields a lower expected cost than the MTE.
We then present an absorbing DLL heuristic. The strategy requires one additional memory location, and is analogous to the scheme presented in [3]. The reorganization is achieved by moving each element exactly once to its final position in the reorganized list. The scheme is stochastically absorbing and it is shown to be optimal for a restricted family of distributions. Thus, for these distributions, the probability of the scheme converging to the optimal list order can be made as close to unity as desired.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Matthews, D. Rotem, and E. BretHolz. Self-organizing doubly-linked lists. J. Comput. Maths., 8(Sec.A):99–106, 1980.
D. T. H. Ng and B. J. Oommen. Generalizing singly-linked reorganizing heuristics for doubly-linked lists. In Proc. of Conf. on Mathematical Foundations of Comp. Sc., pages 380–389, Rytro, Poland, Aug-Sept. 1989.
B. J. Oommen and D. T. H. Ng. Ideal list organization for stationary environments. Technical Report SCS-TR-154, School Of Computer Science, Carleton University, Ottawa, Ont., K1S 5B6, 1989.
J. H. Hester and D. S. Hirschberg. Self-organizing linear search. ACM Computing Surveys, 17(3):295–311, 1985.
R. L. Rivest. On self-organizing sequential search heuristics. Comm. ACM, 19(2):63–67, 1976.
J. P. Tremblay and P. G. Sorenson. An Introduction to Data Structures with Applications. McGraw-Hill, New York, 1976.
R. S. Valiveti and B. J. Oommen. Self-organizing doubly-linked lists. Technical Report SCS-TR-173, School Of Computer Science, Carleton University, Ottawa, Ont., K1S 5B6, May 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer Science+Business Media New York
About this chapter
Cite this chapter
Valiveti, R.S., Oommen, B.J. (1992). New Absorbing and Ergodic Doubly-Linked List Reorganizing Heuristics. In: Baeza-Yates, R., Manber, U. (eds) Computer Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3422-8_16
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3422-8_16
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6513-6
Online ISBN: 978-1-4615-3422-8
eBook Packages: Springer Book Archive