The distribution of a program in primary and fast buffer storage

Authors:
Erol Gelenbe
Affiliations:
Institut de Recherche d'Informatique et d'Automatique, Rocquencourt, France
Venue:
Communications of the ACM
Year:
1973

Citing 2
Cited 5

Virtual Memory

ACM Computing Surveys (CSUR)
Dynamic space-sharing in computer systems

Communications of the ACM

Bibliography on paging and related topics

ACM SIGOPS Operating Systems Review
Characteristics and models of program behaviour

ACM '76 Proceedings of the 1976 annual conference
A study of program locality and lifetime functions

SOSP '75 Proceedings of the fifth ACM symposium on Operating systems principles
Adaptive prefetching algorithm in disk controllers

Performance Evaluation
An Interview with Erol Gelenbe

Ubiquity

Quantified Score

Hi-index	48.22

Visualization

Abstract

A virtual memory computer system with a fast buffer (cache) memory between primary memory and the central processing unit is considered. The optimal distribution of a program between the buffer and primary memory is studied using the program's lifetime function. Expressions for the distribution of a program which maximizes the useful fraction of the cost-time integral of primary and fast buffer storage are obtained for swapping and nonswapping buffer management policies.