List Factoring and Relative Worst Order Analysis

Relative worst order analysis is a supplement or alternative to competitive analysis which has been shown to give results more in accordance with observed behavior of online algorithms for a range of different online problems. The contribution of this paper is twofold. As the first contribution, it adds the static list accessing problem to the collection of online problems where relative worst order analysis gives better results. List accessing is a classic data structuring problem of maintaining optimal ordering in a linked list. It is also one of the classic problems in online algorithms, in that it is used as a model problem, along with paging and a few other problems, when trying out new techniques and quality measures. As the second contribution, this paper adds the non-trivial supplementary proof technique of list factoring to the theoretical toolbox for relative worst order analysis. List factoring is perhaps the most successful technique for analyzing list accessing algorithms, reducing the complexity of the analysis of algorithms on full-length lists to lists of length two.

[1]  Susanne Albers,et al.  Improved randomized on-line algorithms for the list update problem , 1995, SODA '95.

[2]  Jon Louis Bentley,et al.  Amortized analyses of self-organizing sequential search heuristics , 1985, CACM.

[3]  John McCabe,et al.  On Serial Files with Relocatable Records , 1965 .

[4]  Leah Epstein,et al.  Comparing online algorithms for bin packing problems , 2012, J. Sched..

[5]  Sandy Irani,et al.  A Comparison of Performance Measures for Online Algorithms , 2014, Algorithmica.

[6]  Joan Boyar,et al.  The relative worst order ratio for online algorithms , 2007, TALG.

[7]  Ran El-Yaniv,et al.  Online list accessing algorithms and their applications: recent empirical evidence , 1997, SODA '97.

[8]  Alejandro López-Ortiz,et al.  Parameterized Analysis of Paging and List Update Algorithms , 2009, Algorithmica.

[9]  Marek Chrobak,et al.  SIGACT news online algorithms column 8 , 2005, SIGA.

[10]  Christos H. Papadimitriou,et al.  Beyond competitive analysis [on-line algorithms] , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[11]  Leah Epstein,et al.  Separating Scheduling Algorithms with the Relative Worst Order Ratio , 2006 .

[12]  Boris Teia,et al.  A Lower Bound for Randomized List Update Algorithms , 1993, Inf. Process. Lett..

[13]  Gerhard J. Woeginger,et al.  Developments from a June 1996 seminar on Online algorithms: the state of the art , 1998 .

[14]  Susanne Albers,et al.  Self-Organizing Data Structures , 1996, Online Algorithms.

[15]  Joan Boyar,et al.  The Relative Worst Order Ratio for On-Line Algorithms , 2003, CIAC.

[16]  Sandy Irani,et al.  Two Results on the List Update Problem , 1991, Inf. Process. Lett..

[17]  Alejandro López-Ortiz,et al.  On the Separation and Equivalence of Paging Strategies and Other Online Algorithms , 2018, Algorithmica.

[18]  Allan Borodin,et al.  A new measure for the study of on-line algorithms , 2005, Algorithmica.

[19]  Jeffery R. Westbrook,et al.  Randomized competitive algorithms for the list update problem , 1991, SODA '91.

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

[21]  Joan Boyar,et al.  The relative worst order ratio applied to paging , 2005, SODA '05.

[22]  Leah Epstein,et al.  Separating online scheduling algorithms with the relative worst order ratio , 2006, J. Comb. Optim..

[23]  Alejandro López-Ortiz,et al.  A Survey of Performance Measures for On-line Algorithms , 2005, SIGACT News.

[24]  Theodoulos Garefalakis,et al.  A New Family of Randomized Algorithms for List Accessing , 1997, ESA.

[25]  Joan Boyar,et al.  The relative worst order ratio applied to seat reservation , 2004, TALG.

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

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

[28]  Anna R. Karlin,et al.  Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[29]  C. Kenyon.  Best-fit bin-packing with random order , 1996, SODA '96.

[30]  Bernhard von Stengel,et al.  A Combined BIT and TIMESTAMP Algorithm for the List Update Problem , 1995, Inf. Process. Lett..

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