Average-case and smoothed competitive analysis of the multilevel feedback algorithm

Mathematics of Operations Research

Volumn 31, Issue 1, 2006, Pages 85-108

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

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^c MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

Average case analysis; Competitive analysis; Multilevel feedback; Scheduling

Indexed keywords

ALGORITHMS; INTEGER PROGRAMMING; JOB ANALYSIS; ONLINE SYSTEMS; OPERATIONS RESEARCH; PROBABILITY; RANDOM PROCESSES; SCHEDULING;

ADDITIVE SYMMETRIC SMOOTHING; AVERAGE-CASE ANALYSIS; COMPETITIVE ANALYSIS; MULTILEVEL FEEDBACKS;

FEEDBACK CONTROL;

EID: 33646731881     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1050.0170     Document Type: Article

References (26)

1. Alon, N., J. H. Spencer. 2000. The Probabilistic Method. 2nd ed. Wiley-Interscience Series in Discrete Mathematics. Wiley, Chichester, UK.
2. Banderier, C., R. Beier, K. Mehlhorn. 2003. Smoothed analysis of three combinatorial problems. 28th Internat. Sympos. Math. Foundations Compta. Sci. LNCS, No. 2747. Springer. Berlin, Germany, 198-207.
3. Becchetti, L., S. Leonardi. 2004. Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines. J. ACM 51(4) 517-539.
4. Becchetti, L., S. Leonardi, A. Marchetti-Spaccamela, G. Schäfer, T. Vredeveld. 2003. Average ease and smoothed competitive analysis of the multi-level feedback algorithm. Proc. 44th Annual IEEE Sympos. Foundations Comput. Sci. 462-471.
5. Beier, R., B. Vöcking. 2003. Random knapsack in expected polynomial time. Proc. 35th Annual ACM Sympos. Theory Comput. 232-241.
6. Beier, R., B. Vöcking. 2004. Typical properties of winners and losers in discrete optimization. Proc. 36th Annual ACM Sympos. Theory Comput. 343-352.
7. Beier, R., A. Czumaj, P. Krysta, B. Vöcking. 2004. Computing equilibria for congestion games with (im)perfect information. Proc. 15th Annual ACM-SIAM Sympos. Discrete Algorithms 739-748.
8. Blum, A., J. Dunagan. 2002. Smoothed analysis of the perceptron algorithm. Proc. 13th Annual ACM-SIAM Sympos. Discrete Algorithms 905-914.
9. Borodin, A., R. El-Yaniv. 1998. Online Computation and Competitive Analysis. Cambridge University Press, New York.
10. Borodin, A., S. Irani, P. Raghavan, B. Schieber. 1995. Competitive paging with locality of reference. J. Comput. System Sci. 50(2) 244-258.
11. Feller, W. 1967. An Introduction to Probability Theory and Its Applications. John Wiley & Sons. Inc., New York.
12. Grimmett, G. R., D. R. Stirzaker. 2001. Probability and Random Processes, 3rd ed. Oxford University Press, New York.
13. Kalyanasundaram, B., K. Pruhs. 2000. Speed is as powerful as clairvoyance. J. ACM 47(4) 617-643.
14. Kalyanasundaram, B., K. Pruhs. 2003. Minimizing flow time nonclairvoyantly. J. ACM 50(4) 551-567.
15. Koutsoupias, E., C. Papadimitriou. 1994. Beyond competitive analysis. Proc. 25th Sympos. Foundations Comput. Sci. 394-400.
16. Leonardi, S., D. Raz. 1997. Approximating total flow time on parallel machines. Proc. 29th Annual ACM Sympos. Theory Comput. 110-119.
17. Michel, J. E., E. G. Coffman, Jr. 1974. Synthesis of a feedback queueing discipline for computer operation. J. ACM 21(2) 329-339.
18. Motwani, R., P. Raghavan. 1995. Randomized Algorithms, 1st ed. Cambridge University Press. Cambridge, UK.
19. Motwani, R., S. Phillips, E. Torng. 1994. Non-clairvoyant scheduling. Theoretical Comput. Sci. 130 17-47.
20. Nutt, G. 1999. Operating System Projects Using Windows NT. Addison-Wesley, Reading, MA.
21. Scharbrodt, M., T. Schickinger, A. Steger. 2002. A new average case analysis for completion time scheduling. Proc. 34th Annual ACM Sympos. Theory Comput., 170-178.
22. Schrage, L. 1968. A proof of the optimality of the shortest remaining processing time discipline. Oper. Res. 16 687-690.
23. Sleator, D., R. E. Tarjan. 1985. Amortized efficiency of list update and paging rules. Comm. ACM 28 202-208.
24. Spielman, D., S. H. Teng. 2003. Smoothed analysis of termination of linear programming algorithms. Math. Programming 97(1-2) 375-104.
25. Spielman, D. A., S. H. Teng. 2004. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. J. ACM 51(3) 385-463.
26. Tanenbaum, A. S. 1992. Modern Operating Systems, Prentice-Hall Inc., Upper Saddle River, NJ.