Journal ArticleDOI
Analysis of the Optimal, Look-Ahead Demand Paging Algorithms
Reads0
Chats0
TLDR
It is seen that look-ahead paging demonstrates an inherent advantage sufficient to account for the differences observed between currently implemented demand paging algorithms and theoretically optimal algorithms.Abstract:
We express the future behavior of programs that may be described by two common program behavior models, the independent reference model and the LRU stack model, by a discrete time Markov chain. Using this Markov chain model, we are able to calculate the theoretical minimum number of page faults for a program representable by either of these models in either a fixed or variable size memory. The behavior of optimal look-ahead and optimal realizable demand paging algorithms are compared, and it is seen that look-ahead paging demonstrates an inherent advantage sufficient to account for the differences observed between currently implemented demand paging algorithms and theoretically optimal algorithms.read more
Citations
More filters
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
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.
Journal ArticleDOI
I/O reference behavior of production database workloads and the TPC benchmarks—an analysis at the logical level
TL;DR: In this paper, the authors present a comprehensive analysis of the logical I/O reference behavior of the peak production database workloads from ten of the world's largest corporations, focusing on how these workloads respond to different techniques for caching, prefetching, and write buffering.
I/O Reference Behavior of Production Database Workloads and the TPC
TL;DR: A comprehensive analysis of the logical I/O reference behavior of the peak productiondatabase workloads from ten of the world's largest corporations, focusing on how these workloads respond to different techniques for caching, prefetching, and write buffering.