On the Performance Enhancement of Paging Systems Through Program Analysis and Transformations

It is possible to improve the paging performance of a program by applying transformations to the source program that improve data access locality. We discuss this subject in general terms, including automation of these transformations, and present a number of such transforms. This is followed by exp...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers 1981-05, Vol.C-30 (5), p.341-356
Main Authors: Abu-Sufah, Kuck, Lawrie
Format: Article
Language:English
Subjects:
Optimizing compiler
program behavior
program transformation
virtual memory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:It is possible to improve the paging performance of a program by applying transformations to the source program that improve data access locality. We discuss this subject in general terms, including automation of these transformations, and present a number of such transforms. This is followed by experimental results which indicate that these transformations are indeed effective. Use of practical, simple memory management policies like the fixed allocation local lru replacement algorithm leads to average improvements over untransformed programs of a factor of 10 in space-time cost, and a factor of 5 in memory size. Multiprogramming questions are also discussed.
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.1981.1675792