Design and analysis of efficient remote buffering strategies for LAN based architectures

Abstract

We design two efficient remote caching algorithms, referred to as DPRPEM and PRPARI for a distributed system with a LAN based architecture to manage the available buffer space at every site and to minimize the average response time. The proposed algorithms, which determine the page that needs to be swapped out of main memory to make sufficient room for an incoming page, form one of the three components of a remote caching architecture (RCA) paradigm. The algorithms are based on computing the relative importance of a page and then performing operations like page-exchange and page-migration. DPRPEM exploits actual page access information and its performance is proven to outperform the existing algorithms in the existing literature. PRPARI is used to obtain the optimal page allocation among sites when page access rate information is known. We present a rigorous simulation study on the behavior of these algorithms, compare with the existing algorithms, and provide a detailed discussion of the results.