Journal ArticleDOI
Program behavior and the page-fault-frequency replacement algorithm
Wesley W. Chu,Holger Opderbeck +1 more
Reads0
Chats0
TLDR
This paper is concerned with paging systems, that is, systems for which the blocks of contiguous locations are of equal size and the occurrence of a reference to a page that is currently not in main memory is called a page fault.Abstract:
Virtual memory is one of the major concepts that has evolved in computer architecture over the last decade. It has had a great impact on the design of new computer systems since it was first introduced by the designers of the Atlas computer in 1962. A virtual memory is usually divided into blocks of contiguous locations to allow an efficient mapping of the logical addresses into the physical address space. In this paper, we are concerned with paging systems, that is, systems for which the blocks of contiguous locations are of equal size. The memory system consists of two levels: main memory and auxiliary memory. The occurrence of a reference to a page that is currently not in main memory is called a page fault. A page fault results in the interruption of the program and the transfer of the referenced page from auxiliary to main memory.read more
Citations
More filters
Journal ArticleDOI
Cache Memories
TL;DR: Specific aspects of cache memories investigated include: the cache fetch algorithm (demand versus prefetch), the placement and replacement algorithms, line size, store-through versus copy-back updating of main memory, cold-start versus warm-start miss ratios, mulhcache consistency, the effect of input /output through the cache, the behavior of split data/instruction caches, and cache size.
Journal ArticleDOI
Working Sets Past and Present
TL;DR: This paper outlines the argument why it is unlikely that anyone will find a cheaper nonlookahead memory policy that delivers significantly better performance and suggests that a working set dispatcher should be considered.
Journal ArticleDOI
Principles of database buffer management
Wolfgang Effelsberg,Theo Haerder +1 more
TL;DR: This paper discusses the implementation of a database buffer manager as a component of a DBMS, the interface between calling components of higher system layers and the buffer manager is described, and the principal differences between virtual memory paging and database buffer management are outlined.
Journal ArticleDOI
Long term file migration: development and evaluation of algorithms
TL;DR: This work develops and evaluates (replacement) algorithms for the selection of files to be moved from disk to mass storage and finds that algorithms based on both the file size and the time since the file was last used work well.
Journal ArticleDOI
An inter-reference gap model for temporal locality in program behavior
TL;DR: A k order Markov chain based scheme to model the sequence of time intervals between successive references to the same address in memory during program execution, which is called the Inter-Reference Gap (IRG) model.
References
More filters
Journal ArticleDOI
Evaluation techniques for storage hierarchies
TL;DR: A new and efficient method of determining, in one pass of an address trace, performance measures for a large class of demand-paged, multilevel storage systems utilizing a variety of mapping schemes and replacement algorithms.
Journal ArticleDOI
The working set model for program behavior
TL;DR: A new model, the “working set model,” is developed, defined to be the collection of its most recently used pages, which provides knowledge vital to the dynamic management of paged memories.
Journal ArticleDOI
Dynamic space-sharing in computer systems
Laszlo A. Belady,C. J. Kuehner +1 more
TL;DR: A formalization of relationships between space-sharing, program behavior, and processor efficiency in computer systems is presented to illustrate a possible analytic approach to the investigation of the problems of space- Sharing.
Proceedings ArticleDOI
Experiments with program locality
TL;DR: This work has shown that virtual memory systems can be made to run at all and demonstrates that program locality can be used to advantage.
Proceedings ArticleDOI
The page fault frequency replacement algorithm
Wesley W. Chu,Holger Opderbeck +1 more
TL;DR: This paper considers the case of paged memory systems: that is, the physical and logical address space of these systems is partitioned into equal size blocks of contiguous addresses.