Abstract
In the last 20 years competitive analysis has become the main tool for analyzing the quality of online algorithms. Despite of this, competitive analysis has also been criticized: It sometimes cannot discriminate between algorithms that exhibit significantly different empirical behavior, or it even favors an algorithm that is worse from an empirical point of view. Therefore, there have been several approaches to circumvent these drawbacks. In this survey, we discuss probabilistic alternatives for competitive analysis.
Article PDF
Similar content being viewed by others
References
Albers S, Favrholdt LM, Giel O (2005) On paging with locality of reference. J Comput Syst Sci 70(2):145–175
Anderson EJ, Potts CN (2004) On-line scheduling of a single machine to minimize total weighted completion time. Math Oper Res 29:686–697
Angelopoulos S, Schweitzer P (2009) Paging and list update under bijective analysis. In: Proceedings of the 20th ACM-SIAM symposium on discrete algorithms, pp 1136–1145
Angelopoulos S, Dorrigiv R, López-Ortiz A (2007) On the separation and equivalence of paging strategies. In: Proceedings of the 18th ACM-SIAM symposium on discrete algorithms, pp 229–237
Banderier C, Beier R, Mehlhorn K (2003) Smoothed analysis of three combinatorial problems. In: Proceedings of the 28th international symposium on mathematical foundations of computer science. Lecture notes in computer science, vol 2747. Springer, Berlin, pp 198–207
Becchetti L (2004) Modeling locality: a probabilistic analysis of LRU and FWF. In: Proceedings of the 12th European symp on algorithms (ESA), pp 98–109
Becchetti L, Leonardi S (2004) Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines. J ACM 51:517–539
Becchetti L, Leonardi S, Marchetti-Spaccamela A, Schäfer G, Vredeveld T (2006) Average case and smoothed competitive analysis for the multi-level feedback algorithm. Math Oper Res 31(1):85–108
Beier R, Czumaj A, Krysta P, Vöcking B (2004) Computing equilibria for congestion games with (im)perfect information. In: Proceedings of the 15th annual ACM-SIAM symposium on discrete algorithms, pp 739–748
Bentley JL, Johnson DS, Leighton FT, McGeoch CC, McGeoch LA (1984) Some unexpected expected behavior results for bin packing. In: Proceedings of the 16th annual ACM symposium on theory of computing, pp 279–288
Borodin A, Irani S, Raghavan P, Schieber B (1995) Competitive paging with locality of reference. J Comput Syst Sci 50(2):244–258
Borodin A, Linial N, Saks ME (1992) An optimal on-line algorithm for metrical task systems. J ACM 39(4):745–763
Chandra B (1992) Does randomization help in on-line bin packing? Inf Process Lett 43(1):15–19
Coffman EG Jr, Gilbert EN (1985) On the expected relative performance of list scheduling. Oper Res 33(3):548–561
Coffman EG Jr, So K, Hofri M, Yao AC (1980) A stochastic model of bin-packing. Inf Control 44:105–115
Coffman EG Jr, Garey MR, Johnson DS, (1997) Approximation algorithms for bin packing: a survey. In: Hochbaum DS (ed) Approximation algorithms for NP-hard problems. PWS, Boston
Coffman EG Jr, Courcoubetis C, Garey MR, Johnson DS, Shor PW, Weber RR, Yannakakis M (2002) Perfect packing theorems and the average-case behavior of optimal and online bin packing. SIAM Rev 44(1):95–108
Correa J, Wagner M (2009) LP-based online scheduling: from single machine to parallel machines. Math Program 119(1):109–136
Csirik J, Johnson DS (2001) Bounded space on-line bin packing: best is better than first. Algorithmica 11:115–138
Fiat A, Karp RM, Luby M, McGeoch LA, Sleator DD, Young NE (1991) Competitive paging algorithms. J Algorithms 12:685–699
Franaszek PA, Wagner TJ (1974) Some distribution-free aspects of paging algorithm performance. J ACM 21(1):31–39
Graham RL (1966) Bounds for certain multiprocessor anomalies. Bell Syst Tech J 45:1563–1581
Hiller B (2009) Online optimization: probabilistic analysis and algorithm engineering. PhD thesis, TU Berlin
Hiller B, Vredeveld T (2008) On the optimality of least recently used. ZIB-Report 08-39, Zuse Institute Berlin
Hiller B, Vredeveld T (2008) Probabilistic analysis of online bin coloring algorithms via stochastic comparison. In: Proceedings of the 16th annual European symposium on algorithms. Lecture notes in computer science, vol 5193. Springer, Berlin, pp 528–539
Hoogeveen H, Vestjens APA (1996) Optimal on-line algorithms for single-machine scheduling. In: Cunningham WH, McCormick ST, Queyranne M (eds) Proceedings of the 5th conference on integer programming and combinatorial optimization IPCO. Lecture notes in computer science, vol 1084. Springer, Berlin, pp 404–414
Johnson DS (1974) Fast algorithms for bin packing. J Comput Syst Sci 8(8):272–314
Johnson DS, Demers A, Ullman JD, Garey MR, Graham RL (1974) Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J Comput 3(4):299–325
Kalyanasundaram B, Pruhs K (2000) Speed is as powerful as clairvoyance. J ACM 47(4):617–643
Karlin AR, Manasse MS, Rudolph L, Sleator DD (1988) Competitive snoopy caching. Algorithmica 3:70–119
Karlin AR, Phillips SJ, Raghavan P (2000) Markov paging. SIAM J Comput 30(2):906–922
Kawaguchi T, Kyan S (1986) Worst case bound of an LRF schedule for the mean weighted flow-time problem. SIAM J Comput 15:1119–1129
Koutsoupias E, Papadimitriou C (1994) Beyond competitive analysis. In: Proceedings of the 35th annual IEEE symposium on foundations of computer science, pp 394–400
Krumke SO, de Paepe WE, Stougie L, Rambau J (2001) Online bin coloring. In: auf der Heide FM (ed) Proceedings of the 9th annual European symposium on algorithms. Lecture notes in computer science, vol 2161, pp 74–84
Lee CC, Lee DT (1985) A simple online bin-packing algorithm. J ACM 32(3):562–572
McGeoch LA, Sleator DD (1991) A strongly competitive randomized paging algorithm. Algorithmica 6:816–825
Möhring RH, Schulz AS, Uetz M (1999) Approximation in stochastic scheduling: the power of LP-based priority policies. J ACM 46:924–942
Motwani R, Phillips S, Torng E (1994) Non-clairvoyant scheduling. Theor Comput Sci 130:17–47
Panagiotou K, Souza A (2006) On adequate performance measures for paging. In: STOC ’06: Proceedings of the 38th annual ACM symposium on theory of computing, pp 487–496
Pruhs K, Sgall J, Torng E (2004) Online scheduling. In: Leung J (ed) Handbook of scheduling: algorithms, models, and performance analysis. CRC Press, Boca Raton
Richey MB (1991) Improved bounds for harmonic-based bin packing algorithms. Discrete Appl Math 34(1–3):203–227
Scharbrodt M, Schickinger T, Steger A (2006) A new average case analysis for completion time scheduling. J. ACM 121–146
Schrage L (1968) A proof of the optimality of the shortest remaining processing time discipline. Oper Res 16:687–690
Seiden S (2000) A guessing game and randomized online algorithms. In: Proceedings of the 32nd ACM symposium on theory of computing, pp 592–601
Shor PW (1986) The average-case analysis of some on-line algorithms for bin packing. Combinatorica 6(2):179–200
Sleator DD, Tarjan RE (1985) Amortized efficiency of list update and paging rules. Commun ACM 28(2):202–208
Souza A (2010) Adversarial models in paging—bridging the gap between theory and practice. Comput Sci Res Dev, this issue
Souza A, Steger A (2006) The expected competitive ratio for weighted completion time scheduling. Theory Comput Syst 39:121–136
Spielman DA, Teng SH (2004) Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. J ACM 51:385–463
Torng E (1998) A unified analysis of paging and caching. Algorithmica 20(1):175–200
van Vliet A (1996) On the asymptotic worst case behavior of harmonic fit. J Algorithms 20(1):113–136
Vestjens APA (1997) On-line machine scheduling. PhD thesis, Eindhoven University of Technology, Netherlands
Vredeveld T (2010) Stochastic online scheduling. Comput Sci Res Dev, this issue
Yao AC (1980) New algorithms for bin packing. J ACM 27(2):207–227
Young NE (1994) The k-server dual and loose competitiveness for paging. Algorithmica 11(6):525–541
Young NE (2000) On-line paging against adversarially biased random inputs. J Algorithms 37(1):218–235
Author information
Authors and Affiliations
Corresponding author
Additional information
Work of B. Hiller partially supported by the DFG research group “Algorithms, Structure, Randomness” (Grant number GR 883/10-3, GR 883/10-4) and the DFG research center Matheon Berlin.
Rights and permissions
About this article
Cite this article
Hiller, B., Vredeveld, T. Probabilistic alternatives for competitive analysis. Comput Sci Res Dev 27, 189–196 (2012). https://doi.org/10.1007/s00450-011-0149-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00450-011-0149-1