A New Proposed Cost Model for List Accessing Problem using Buffering

Details A New Proposed Cost Model for List Accessing Problem using Buffering A New Proposed Cost Model for List Accessing Problem using Buffering

2011-09-10

arxiv.org/abs/1109.2232v1

International Journal of Computer Applications, Volume 22-- No.8, May 2011

Computer Science

Data Structures and Algorithms

05 Pages, 2 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A New Proposed Cost Model for List Accessing Problem using Buffering 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 A New Proposed Cost Model for List Accessing Problem using Buffering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Proposed Cost Model for List Accessing Problem using Buffering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-38663