A New Proposed Cost Model for List Accessing Problem using Buffering

TL;DR

This paper introduces a novel cost model for the list accessing problem that incorporates access, matching, and replacement costs, utilizing buffering and lookahead techniques without list rearrangement.

Contribution

It proposes a new cost model considering multiple costs and a processing method using buffering and lookahead, differing from traditional rearrangement strategies.

Findings

The new model effectively captures various cost factors in list accessing.

Buffering and lookahead improve request processing efficiency.

The model provides a comprehensive framework for analyzing list access costs.

Abstract

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.