List Accessing Problem is a well studied research problem in the context of linear search. Input to the list accessing problem is an unsorted linear list of distinct elements along with a sequence of requests, where each request is an access operation on an element of the list. A list accessing algorithm reorganizes the list while processing a request sequence on the list in order to minimize the access cost. Move-To-Front algorithm has been proved to be the best performing list accessing online algorithm till date in the literature. Characterization of the input request sequences corresponding to practical real life situations is a big challenge for the list accessing problem. As far as our knowledge is concerned, no characterization for the request sequences has been done in the literature till date for the list accessing problem. In this paper, we have characterized the request sequences for the list accessing problem based on several factors such as size of the list, size of the request sequence, ordering of elements and frequency of occurrence of elements in the request sequence. We have made a comprehensive study of MTF list accessing algorithm and obtained new theoretical results for our characterized special class of request sequences. Our characterization will open up a new direction of research for empirical analysis of list accessing algorithms for real life inputs.
There are many existing well known cost models for the list accessing
problem. The standard cost model developed by Sleator and Tarjan is most widely
used. In this paper, we have made a comprehensive study of the existing cost
models and proposed a new cost model for the list accessing problem. In our
proposed cost model, for calculating the processing cost of request sequence
using a singly linked list, we consider the access cost, matching cost and
replacement cost. The cost of processing a request sequence is the sum of
access cost, matching cost and replacement cost. We have proposed a novel
method for processing the request sequence which does not consider the
rearrangement of the list and uses the concept of buffering, matching, look
ahead and flag bit.Comment: 05 Pages, 2 figure
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.