An extension of the performance of a database manager in a virtual memory system using partially locked virtual buffers

Brice, Richard; Sherman, Stephen W.

doi:10.1145/320544.320556

Cited by 13 publications

(3 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Brice and Sherman [4] have performed a series of experiments, some of which are relevant to this study. In particular, they report on double paging rates and reference paging rates for LRU buffer replacement and random memory replacement.…”

Section: Resultsmentioning

confidence: 99%

Effect of Replacement Algorithms on a Paged Buffer Database System

Fernández¹,

Lang²,

Wood³

1978

IBM J. Res. & Dev.

View full text Add to dashboard Cite

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.

show abstract

Section: Resultsmentioning

confidence: 99%

Effect of Replacement Algorithms on a Paged Buffer Database System

Fernández¹,

Lang²,

Wood³

1978

IBM J. Res. & Dev.

View full text Add to dashboard Cite

show abstract

“…Applications that exhibit virtual memory thrashing are performance bound to auxiliary memory speeds, which are several orders of magnitude slower than main memory 2 . When coupled with most buffer managers in modern databases, this can also lead to the double paging problem [Brice and Sherman, 1977;Chew and Silberschatz, 1992;Fernandez et al, 1978;Goldberg and Hassinger, 1974;Lang et al, 1977;Sherman and Brice, 1976a,b;Tuel, 1976].…”

Section: Virtual Memorymentioning

confidence: 99%

“…This size should be limited so that it can fit in physical memory [Garcia-Molina et al, 2000]. The size may exceed phyiscal memory and extend into virtual memory, however, this may lead to thrashing or the double paging phenomenon [Brice and Sherman, 1977;Chew and Silberschatz, 1992;Fernandez et al, 1978;Goldberg and Hassinger, 1974;Lang et al, 1977;Sherman and Brice, 1976a,b;Tuel, 1976].…”

Section: Buffer Managementmentioning

confidence: 99%

JDiet: Footprint Reduction for Memory-constrained Systems

Huffman¹

View full text Add to dashboard Cite

Main memory remains a scarce computing resource. Even though main memory is becoming more abundant, software applications are inexorably engineered to consume as much memory as is available. For example, expert systems, scientific computing, data mining, and embedded systems commonly suffer from the lack of main memory availability. This thesis introduces JDiet, an innovative memory management system for Java applications. The goal of JDiet is to provide the developer with a highly configurable framework to reduce the memory footprint of a memory-constrained system, enabling it to operate on much larger working sets. Inspired by buffer management techniques common in modern database management systems, JDiet frees main memory by evicting non-essential data to a disk-based store. A buffer retains a fixed amount of managed objects in main memory. As non-resident objects are accessed, they are swapped from the store to the buffer using an extensible replacement policy.While the Java virtual machine naïvely delegates virtual memory management to the operating system, JDiet empowers the system designer to select both the managed data and replacement policy.

show abstract

Page replacement algorithm for large‐array manipulation

Muramatsu

Negishi

1980

Softw Pract Exp

View full text Add to dashboard Cite

The Least Recently Used (LRU) method is the technique that is most often used for a page replacement algorithm. However, LRU may not be an effective method for some large‐array manipulation. A method for solving this problem is presented in this paper. In this method, the Operating System (OS) automatically detects loops that are not suitable for the LRU method. There is no necessity to modify application programs nor any additional overhead as long as sufficient real memory is provided. Therefore this method is most suitable for practical use. It functions on the basis of information about the relationship between the working set size and the window size, and indication of whether the detected page fault is caused by an instruction fetch or an operand fetch, etc. The results of experiments and improvements are also shown.

show abstract

An extension of the performance of a database manager in a virtual memory system using partially locked virtual buffers

Cited by 13 publications

References 3 publications

Effect of Replacement Algorithms on a Paged Buffer Database System

Effect of Replacement Algorithms on a Paged Buffer Database System

JDiet: Footprint Reduction for Memory-constrained Systems

Page replacement algorithm for large‐array manipulation

Contact Info

Product

Resources

About