Amortized efficiency of list update and paging rules

Communications of the ACM

Volumn 28, Issue 2, 1985, Pages 202-208

  Sleator, Daniel D ^a   Tarjan, Robert E ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AMORTIZED EFFICIENCY; LIST UPDATE; PAGING RULES;

COMPUTER PROGRAMMING;

EID: 0022012946     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/2786.2793     Document Type: Article

References (9)

1. Andqrson, E.J., Nash, I’. and Weber, R.R. A counterexample to a conjecture on optimal list ordering. {. Appl. Prob. to appear.]
2. Belady, L.A. A study of replacement algorithms for virtual storage computers. IBM Syst. J 5 (19&j), 78-101.]
3. Bentley, J.L., and McCeoch, C. Worst-case analysis of self-organizing seouential search heuristics. In Proceedings of 2Ofh Allerton Confcrence on Communication, Control, and Cornfifing, (Univ. Illinois, Urbana-Champaign. Oct. 6-8,1962), 1983.45~461.]
4. Bitner. J. R. Heuristics that dynamically organize data structures. SIAMJ. Comput. 8 (1979). 82-110.]
5. Coffman. E. G. and Denning, P.J. Operating Systems Theorlj, Prentice- Hall, Englewood Cliffs, NJ, 1973.]
6. Franaszek, P.A. and Wagner, T.J. Some distribution-free aspects of paging performance. J. ACM 21, 1 (Jan. 1974), 31-39.]
7. Knuth. DE. The Art of Computer Programming, Volume 3: Sorting and Searching Addison-Wesley, Reading, MA, 1973.]
8. Rivest. R. On self-organizing sequential search heuristics. Commun. ACM 19, 2 {Feb. 1976), 63-67.]
9. Spirn, J.R. Progam Behavior: Models and Measurements. Elsevier, New York. 1977.]