A Study of Buffer Management Policies for Data Management Systems.

Abstract

Using a simulation model, several buffer assignment algorithms were investigated experimentally. A simple least-recently-used (LRU) technique was compared with one which took into account the type of data and the number of current users (DS). Also investigated was the use of anticipatory fetching. Performance as a function of the number of available buffers was measured for each strategy. For the application and job mix in question it turns out that anticipatory fetching does not pay, and that DS in general behaves somewhat better than LRU.

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1976
Accession Number
ADA027890

Entities

People

  • Allen Reiter

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computing-Related Activities
  • Data Management
  • Records Management
  • Simulations

Fields of Study

  • Computer science

Readers

  • Logistics and Supply Chain Management.
  • Parallel and Distributed Computing.
  • Theoretical Analysis.