Resource Augmentation

This chapter introduces resource augmentation, in which the performance of an algorithm is compared to the best-possible solution that is handicapped by less resources. We consider three case studies: online paging, with cache size as the resource; selfish routing, with capacity as the resource; and scheduling, with processor speed as the resource. Resource augmentation bounds also imply "loosely competitive" bounds, which show that an algorithm's performance is near-optimal for most resource levels.

[1]  Nguyen Kim Thang,et al.  Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling , 2013, ESA.

[2]  Neal E. Young,et al.  Competitive paging and dual-guided algorithms for weighted caching and matching (Thesis) , 1991 .

[3]  Tim Roughgarden,et al.  How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[4]  Laszlo A. Belady,et al.  A Study of Replacement Algorithms for Virtual-Storage Computer , 1966, IBM Syst. J..

[5]  Kirk Pruhs,et al.  A tutorial on amortized local competitiveness in online scheduling , 2011, SIGA.

[6]  E.J. Friedman,et al.  Genericity and congestion control in selfish routing , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[7]  K. Nguyen.  Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling , 2013, ESA.

[8]  Linus Schrage,et al.  Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time Discipline , 1968, Oper. Res..

[9]  Umang Bhaskar,et al.  Routing games , 2012 .

[10]  Kane,et al.  Beyond the Worst-Case Analysis of Algorithms , 2020 .

[11]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[12]  Neal E. Young,et al.  On-Line File Caching , 2002, SODA '98.

[13]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[14]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance , 2000, JACM.

[15]  Cynthia A. Phillips,et al.  Optimal Time-Critical Scheduling via Resource Augmentation , 1997, STOC '97.

[16]  Amit Kumar,et al.  Resource augmentation for weighted flow-time explained by dual fitting , 2012, SODA.

[17]  T. Koopmans,et al.  Studies in the Economics of Transportation. , 1956 .

[18]  Kirk Pruhs,et al.  Online scheduling , 2003 .

[19]  Neal Young,et al.  The K-Server Dual and Loose Competitiveness for Paging , 1991, On-Line Algorithms.

[20]  Christos H. Papadimitriou,et al.  Worst-case Equilibria , 1999, STACS.

[21]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .