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.

Additional Metadata
Persistent URL dx.doi.org/10.1007/3-540-51859-2_11
Series Lecture Notes in Computer Science
Citation
Oommen, J, & Ng, D.T.H. (David T. H.). (1989). Optimal constant space move-to-fear list organization. In Lecture Notes in Computer Science. doi:10.1007/3-540-51859-2_11