On the performance of competitive algorithms in practice

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1442, Issue , 1998, Pages 373-384

  Karlin, Anna R ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38149110778     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0029577     Document Type: Conference Paper

References (24)

1. C. Anderson and A. Karlin. Two Adaptive Hybrid Cache Coherency Protocols. In Proceedings of the 1996 Second International Symposium on High-Performance Computer Architecture, San Jose, February 1996.
2. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, O. Waarts. On-line load balancing with applications to machine scheduling and virtual circuit routing. In Proc. 25th Annual ACM Symposium on Theory of Computing, 1993.
3. B. Awerbuch, Y. Azar, S. Plotkin. Throughput-competitive on-line routing. In Proceedings of 34th Annual Symposium on Foundations of Computer Science, 1993.
4. B. Awerbuch, Y. Azar, S. Plotkin, O. Waarts. Competitive Routing of Virtual Circuits with Unknown Durations. In Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 1994.
5. L.A. Belady. A study of replacement algorithms for virtual storage computers. IBM Systems Journal, 5:78-101, 1966.
6. A. Borodin, S. Irani, P. Raghavan, and B. Schieber. Competitive Paging with Locality of Reference. In Proc. 23rd Annual ACM Symposium on Theory of Computing, pages 249-259, 1991.
7. P.J. Denning. Working sets past and present. IEEE Trans. Software Engg., SE-6:64-84, 1980.
8. F. Douglis, P. Krishnan, B. Bershad. Adaptive Disk Spin-down Policies for Mobile Computers. In Proceedings of Second USENIX Symposium on Mobile and Location-Independent Computing, 1995.
9. S.J. Eggers and R.H. Katz. Evaluating the performance of four snooping cache coherency protocols. In Proceedings of 16th Annual International Symposium on Computer Architecture, 1989.
10. A. Fiat and A. Karlin Randomized and Multipointer Paging with Locality of Reference. In Proceedings of 27th ACM Symposium on Theory of Computing, May, 1995.
11. A. Fiat and Z. Rosen. Experimental Studies of Access Graph Based Heuristics: Beating the LRU Standard? In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997.
12. S. Irani, A.R. Karlin and S. Phillips. Strongly competitive algorithms for paging with locality of reference. In Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms, 1992.
13. P.A. Franaszek and T.J. Wagner. Some distribution-free aspects of paging performance. Journal of the ACM, 21:31-39, 1974.
14. R. Gawlick, A. Kamath, S. Plotkin, K. Ramakrishnan. Routing and Admission Control in General Topology Networks. Stanford Technical Report STAN-CS-TR-95-1548.
15. A.R. Karlin, K. Li, M. Manasse, and S. Owicki. Empirical studies of competitive spinning for shared memory multiprocessors. In Proceedings of the 13th ACM Symposium on Operating System Principles, 1991.
16. A. R. Karlin, M. S. Manasse, L. Rudolph, and D.D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):70-119, 1988.
17. A. R. Karlin, M. S. Manasse, L. McGeogh, S. Owicki. Randomized Competitive Algorithms for Nonuniform Problems. Algorithmica, Vol. 11, № 1, January, 1994.
18. E. Koutsoupias and C. Papadimitriou. Beyond competitive analysis. In Proceedings of 35th Annual Symposium on Foundations of Computer Science, 1994.
19. A. Kamath, O. Palmon, S. Plotkin. Routing and Admission Control in General Topology Networks with Poisson Arrivals. In Proceedings of the 7th ACM-SIAM Symposium On Discrete Algorithms, 1996.
20. S. Keshav, C. Lund, S. Phillips, N. Reingold, H. Saran. An Empirical Evaluation of Virtual Circuit Holding Time Policies in IP-over-ATM Networks. AT&T Bell Laboratories Technical Memorandum 39199-11.
21. C. Lund, S. Phillips and N. Reingold. IP-paging and distributional paging. In Proceedings of 35th Annual Symposium on Foundations of Computer Science, 1994.
22. S. Plotkin. Competitive Routing of Virtual Circuits in ATM Networks. Survey, invited paper to IEEE Journal on Selected Areas in Communications.
23. D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, February 1985.
24. J.R. Spim. Program Behavior: Models and Measurements. Elsevier Computer Science Library. Elsevier, Amsterdam, 1977.