Average case and smoothed competitive analysis of the multi-level feedback algorithm

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 462-471

  Becchetti, Luca ^a   Marchetti Spaccamela, Alberto ^a   Leonardi, Stefano ^a   Schäfer, Guido ^b   Vredeveld, Tjark ^c  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c K Z Z Informationstechnik Berlin   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; MATHEMATICAL MODELS; PROBABILITY DENSITY FUNCTION; PROBABILITY DISTRIBUTIONS; QUEUEING THEORY; RANDOM PROCESSES; STATISTICAL METHODS; THEOREM PROVING;

MULTI-LEVEL FEEDBACK ALGORITHM; PARTIAL BIT RANDOMIZATION MODEL; SMOOTHED COMPETITIVE ANALYSIS;

ALGORITHMS;

EID: 0344981453     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. N. Alon and J. H. Spencer. The Probabilistic Method. Wiley-Interscience Series in Discrete Mathematics. Wiley, Chichester, second edition, 2000.
2. C. Banderier, R. Beier, and K. Mehlhorn. Smoothed analysis of three combinatorial problems. In 28th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2003.
3. L. Becchetti and S. Leonardi. Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines. In Proceedings of the Thirty-Third Annual ACM Symposium on the Theory of Computing, pages 94-103, 2001.
4. L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, G. Schäfer and T. Vredeveld. Average case and smoothed competitive analysis of the multi-level feedback algorithm. Technical Report MPI-I-2003-014, Max-Planck-Institute für Informatik, Saarbrücken, Germany, 2003.
5. R. Beier, P. Krysta, and B. Vöcking. Computing equilibria for congestion games with (im)perfect information. Unpublished manuscript, 2003.
6. A. Blum and J. Dunagan. Smoothed analysis of the perceptron algorithm. In In Proceedings of 13th annual ACM-SIAM Symposium on Discrete Algorithms, pages 905-914, 2002.
7. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
8. A. Borodin, S. Irani, P. Raghavan, and B. Schieber. Competitive paging with locality of reference. Journal of Computer and System Sciences, 50(2):244-258, 1995.
9. J. Dunagan, D. A. Spielman, and S. H. Teng. Smoothed analysis of the Renegar's condition number for linear programming. , accessed 2002.
10. B. Kalyanasundaram and K. Pruhs. Minimizing flow time nonclairvoyantly. In In Proceedings of the Thirty-Eight IEEE Symposium on Foundations of Computer Science, pages 345-352, 1997. To appear in Journal of the ACM.
11. B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance. Journal of the ACM, 47(4):617-643, 2000.
12. E. Koutsoupias and C. Papadimitriou. Beyond competitive analysis. In Proceedings of the Twenty-Fifth Symposium on Foundations of Computer Science, pages 394-400, 1994.
13. S. Leonardi and D. Raz. Approximating total flow time on parallel machines. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 110-119, 1997.
14. J. E. Michel and E. G. Coffman. Synthesis of a feedback queueing discipline for computer operation. Journal of the ACM, 21:329-339, 1974.
15. R. Motwani, S. Phillips, and E. Torng. Non-clairvoyant scheduling. Theoretical Computer Science, 130:17-47, 1994.
16. G. Nutt. Operating System Projects Using Windows NT. Addison Wesley, Reading, 1999.
17. A. Sankar, D. A. Spielman, and S. H. Teng. Smoothed analysis of the condition numbers and growth factors of matrices. , accessed 2002.
18. M. Scharbrodt, T. Schickinger, and A. Steger. A new average case analysis for completion time scheduling. In Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, pages 170-178, 2002.
19. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, 1985.
20. D. Spielman and S. H. Teng. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pages 296-305, 2001.
21. D. Spielman and S. H. Teng. Smoothed analysis of property testing. , 2002.
22. D. Spielman and S. H. Teng. Smoothed analysis of interior-point algorithms: Termination. , submitted, 2003.
23. A. S. Tanenbaum. Modern Operating Systems. Prentice-Hall Inc., 1992.