Characterization of Request Sequences for List Accessing Problem and New Theoretical Results for MTF Algorithm

Computer Science – Data Structures and Algorithms

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

06 pages, 1 figure

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Characterization of Request Sequences for List Accessing Problem and New Theoretical Results for MTF Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Characterization of Request Sequences for List Accessing Problem and New Theoretical Results for MTF Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Characterization of Request Sequences for List Accessing Problem and New Theoretical Results for MTF Algorithm will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-38654

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.