Performance Evaluation of A Proposed Variant of Frequency Count (VFC) List Accessing Algorithm

TL;DR

This paper introduces a new variant of the Frequency Count list accessing algorithm, called VFC, which outperforms the traditional FC algorithm based on experimental evaluation using real-world data.

Contribution

The paper proposes a novel VFC algorithm that incorporates weak look ahead to improve list accessing performance over the standard FC algorithm.

Findings

VFC outperforms FC on all tested request sequences.

Experimental results are based on Calgary Corpus data.

VFC demonstrates improved efficiency in list accessing tasks.

Abstract

Frequency Count (FC) algorithm is considered as the static optimal algorithm for the list accessing problem. In this paper, we have made a study of FC algorithm and explore its limitation. Using the concept of weak look ahead, we have proposed a novel Variant of Frequency Count (VFC) list accessing algorithm. We have evaluated the performance of FC and our proposed VFC algorithm experimentally using input data set from Calgary Corpus. Our experiments show that for all request sequences and list generated from the above data set VFC performs better than FC.