NDLI: On the Competitive Theory and Practice of Online List Accessing Algorithms

Content Provider	Springer Nature Link
Copyright Year	2001
Abstract	This paper concerns the online list accessing problem. In the first part of the paper we present two new families of list accessing algorithms. The first family is of optimal, 2-competitive, deterministic online algorithms. This family, called the MRI (MOVE-TO-RECENT-ITEM) family, includes as members the well-known MOVE-TO-FRONT (MTF) algorithm and the recent, more ``conservative'' algorithm TIMESTAMP due to Albers. So far MOVE-TO-FRONT and TIMESTAMP were the only algorithms known to be optimal in terms of their competitive ratio. This new family contains a sequence of algorithms { A(i) }i \geq 1 where A(1) is equivalent to TIMESTAMP and the limit element A(∈fty) is \mtf. Further, in this class, for each i , the algorithm A(i) is more conservative than algorithm A(i+1) in the sense that it is more reluctant to move an accessed item to the front, thus giving a gradual transition from the conservative TIMESTAMP to the ``reckless'' MTF. The second new family, called the PRI (PASS-RECENT-ITEM) family, is also infinite and contains TIMESTAMP. We show that most algorithms in this family attain a competitive ratio of 3.In the second, experimental, part of the paper we report the results of an extensive empirical study of the performances of a large set of online list accessing algorithms (including members of our MRI and PRI families). The algorithms' access cost performances were tested with respect to a number of different request sequences. These include sequences of independent requests generated by probability distributions and sequences generated by Markov sources to examine the influence of locality. It turns out that the degree of locality has a considerable influence on the algorithms' absolute and relative costs, as well as on their rankings. In another experiment we tested the algorithms' performances as data compressors in two variants of the compression scheme of Bentley et al. In both experiments, members of the MRI and PRI families were found to be among the best performing algorithms.
Starting Page	201
Ending Page	245
Page Count	45
File Format	PDF
ISSN	01784617
Journal	Algorithmica
Volume Number	32
Issue Number	2
e-ISSN	14320541
Language	English
Publisher	Springer-Verlag
Publisher Date	2002-06-10
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Algorithm Analysis and Problem Complexity Theory of Computation Mathematics of Computing Algorithms Computer Systems Organization and Communication Networks Data Structures, Cryptology and Information Theory
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

List Factoring and Relative Worst Order Analysis

Online Unweighted Knapsack Problem with Removal Cost

On the Competitive Ratio for Online Facility Location

Competitive Analysis of Scheduling Algorithms for Aggregated Links

Knowledge State Algorithms

Parameterized Analysis of Paging and List Update Algorithms

Online Search with Time-Varying Price Bounds

Online Makespan Minimization with Parallel Schedules

Competitive Algorithms for Due Date Scheduling

On the Competitive Theory and Practice of Online List Accessing Algorithms

Similar Documents

List Factoring and Relative Worst Order Analysis

Online Unweighted Knapsack Problem with Removal Cost

On the Competitive Ratio for Online Facility Location

Competitive Analysis of Scheduling Algorithms for Aggregated Links

Knowledge State Algorithms

Parameterized Analysis of Paging and List Update Algorithms

Online Search with Time-Varying Price Bounds

Online Makespan Minimization with Parallel Schedules

Competitive Algorithms for Due Date Scheduling

On the Competitive Theory and Practice of Online List Accessing Algorithms