Resource augmentation for online bounded space bin packing

We study online bounded space bin packing in the resource augmentation model of competitive analysis. In this model, the online bounded space packing algorithm has to pack a list L of items in (0,1] into a small number of bins of size b = 1. Its performance is measured by comparing the produced packing against the optimal offline packing of the list L into bins of size 1. We present a complete solution to this problem: For every bin size b = 1, we design online bounded space bin packing algorithms whose worst case ratio in this model comes arbitrarily close to a certain bound ?(b). Moreover, we prove that no online bounded space algorithm can perform better than ?(b) in the worst case.

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

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

[3]  Piotr Berman,et al.  Speed is More Powerful than Clairvoyance , 1998, Nord. J. Comput..

[4]  Sanjeev Khanna,et al.  Page replacement for general caching problems , 1999, SODA '99.

[5]  Stan Wagon.  Mathematica in action , 1991 .

[6]  Bala Kalyanasundaram,et al.  The Online Transportation Problem , 2000, SIAM J. Discret. Math..

[7]  János Csirik,et al.  On-line packing and covering problems (Chapter 7) , 1998 .

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

[9]  André van Vliet,et al.  An Improved Lower Bound for On-Line Bin Packing Algorithms , 1992, Inf. Process. Lett..

[10]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[11]  Cynthia A. Phillips,et al.  Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract) , 1997, Symposium on the Theory of Computing.

[12]  D. T. Lee,et al.  A simple on-line bin-packing algorithm , 1985, JACM.

[13]  I. Niven,et al.  An introduction to the theory of numbers , 1961 .

[14]  Jeff Edmonds,et al.  Scheduling in the dark , 1999, STOC '99.

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