Extending the Accommodating Function

The applicability of the accommodating function, a relatively new measure for the quality of on-line algorithms, is extended. If a limited amount n of some resource is available, the accommodating function A(?) is the competitive ratio when input sequences are restricted to those for which the amount ?n of resources suffices for an optimal off-line algorithm. The accommodating function was originally used only for ? ? 1. We focus on ? < 1, observe that the function now appears interesting for a greater variety of problems, and use it to make new distinctions between known algorithms and to find new ones.

[1]  Joan Boyar,et al.  The Seat Reservation Problem , 1999, Algorithmica.

[2]  Lyle A. McGeoch,et al.  Competitive Algorithms for Server Problems , 1990, J. Algorithms.

[3]  Tommy R. Jensen,et al.  Graph Coloring Problems: Jensen/Graph , 1994 .

[4]  Neal E. Young,et al.  On-line caching as cache size varies , 1991, SODA '91.

[5]  Tao Jiang,et al.  Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem , 2003, J. Sched..

[6]  Marek Chrobak,et al.  On Some Packing Problem Related to Dynamic Storage Allocation , 1988, RAIRO Theor. Informatics Appl..

[7]  Tommy R. Jensen,et al.  Graph Coloring Problems , 1994 .

[8]  Yossi Azar,et al.  Fair versus Unrestricted Bin Packing , 2000, SWAT.

[9]  Tao Jiang,et al.  Better Bounds on the Accommodating Ratio for the Seat Reservation Problem , 1997, COCOON.

[10]  Yossi Azar,et al.  Fair versus Unrestricted Bin Packing , 2002, Algorithmica.

[11]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance [scheduling problems] , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[12]  Elias Koutsoupias.  Weak adversaries for the k-server problem , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[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]  Eric Torng,et al.  Applying extra-resource analysis to load balancing , 2000, SODA '00.

[16]  Jun Qin,et al.  Coloring interval graphs with first-fit , 1995, Discret. Math..

[17]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[18]  Joan Boyar,et al.  The Accommodating Function: A Generalization of the Competitive Ratio , 2001, SIAM J. Comput..