Effect of replacement algorithms on a paged buffer database system

Authors:
E. B. Fernández;T. Lang;C. Wood
Affiliations:
IBM Scientific Center, Data Processing Division, Los Angeles, California;Computer Science Department, University of California, Los Angeles, California;IBM Scientific Center, Data Processing Division, Los Angeles, California
Venue:
IBM Journal of Research and Development
Year:
1978

Citing 6
Cited 0

Performance of a database manager in a virtual memory system

ACM Transactions on Database Systems (TODS)
An extension of the performance of a database manager in a virtual memory system using partially locked virtual buffers

ACM Transactions on Database Systems (TODS)
Database buffer paging in virtual storage systems

ACM Transactions on Database Systems (TODS)
Operating Systems Theory

Operating Systems Theory
Empirical Data Reference Behavior in Data Base Systems

Computer
Experiments with program locality

AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a database system a buffer may be used to hold recently referenced pages. If this buffer is in virtual memory, the database paging system and the memory paging system affect its performance. The study of the effect of main memory replacement algorithms on the number of main memory page faults is the basic objective of this paper. We assume that the buffer replacement algorithm is least recently used (LRU), and page fault rates for LRU, random (R), and generalized least recently used (GLRU) main memory replacement algorithms are calculated and compared. A set of experiments validates these fault rate expressions and establishes some conditions for the practical application of the results.