VLRU: Buffer Management in Client-Server Systems
نویسندگان
چکیده
In a client-server system, when LRU or its variant buffer replacement strategy is used on both the client and the server, the cache performance on the server side is very poor mainly because of pages duplicated in both systems. This paper introduces a server buffer replacement strategy which uses a replaced page-id than a request page-id, for the primary information for its operations. The importance of the corresponding pages in the server cache is decided according to the replaced page-ids that are delivered from clients to the server, so that locations of the pages are altered. Consequently, if a client uses LRU as its buffer replacement strategy, then the server cache is seen by the client as a long virtual client LRU cache extended to the server. Since the replaced page-id is only sent to the server by piggybacking whenever a new page fetch request is sent, the operation to deliver the replaced page-id is simple and induces a minimal overhead. We show that the proposed strategy reveals good performance characteristics in diverse situations, such as single and multiple clients, as well as with various access patterns. key words: buffer replacement algorithm, LRU, client-server database
منابع مشابه
Global Memory Management in Client-Server DBMS Architectures
Earlier performance studies of client-server database systems have investigated algorithms for caching locks and data at client worhxtations to reafuce latency and offload the server. These studies have been restricted to algorithms in which d&abase pages that were not in the local client buffer pool or the server buffer pool were read in from disk. In this paper we investigate a technique that...
متن کاملImplementing Dynamic Code Assembly for Client-Based Query Processing
As determined by the applications’ requirements, nonstandard DBMS are usually conceived for client/server architectures [5, 12]. While the server is responsible for general data-management tasks and for precomputing data, application-oriented processing is done in the mainmemory buffer at the client. Since the expressive power of the query language should be available not only for loading/unloa...
متن کاملOptimal Bandwidth-Buffer Tradeoff for VBR Media Transmission over the Relay-Server
In a client-server system, the minimum bandwidth required to transmit a pre-recorded VBR media can be computed in O(n). As the frame number n is usually very large, this resource management procedure is not suitable for online computation. Although an O(nlogn) algorithm has been proposed to characterize the bandwidth-buffer tradeoff for the optimal resource management (a native algorithm takes ...
متن کاملOn Two-Echelon Multi-Server Queue with Balking and Limited Intermediate Buffer
In this paper we study two echelon multi-server tandom queueing systems where customers arrive according to a poisson process with two different rates. The service rates at both echelons are independent of each other. The service times of customers is assumed to be completed in two stages. The service times at each stage are exponentially distributed. At the first stage, the customers may balk ...
متن کاملA Server Coordinated Predictive Buffer Management Scheme to Reduce Bandwidth Requirement for Synthetic Multimedia Movies over the Internet
Currently, for the display of synthetic and archived multimedia movies and clips, buffers are managed at the server end (push mode), at the client end (pull mode), or in the push-pull mode to avoid excessive server side disk access time, avoid hot spots for multiple disk accesses for the same media objects, and/or to smoothen the effect of variations in transmission delay. However, the current ...
متن کامل