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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computers Jg. C-30; H. 5; S. 341 - 356
Hauptverfasser: Abu-Sufah, Kuck, Lawrie
Format: Journal Article
Sprache:Englisch
Veröffentlicht: IEEE 01.05.1981
Schlagworte:
Arrays
Clustering algorithms
Computer science
Computers
Costs
Indexes
Memory management
Optimizing compiler
Pipelines
program behavior
program transformation
Resource management
Silicon
virtual memory
ISSN:0018-9340, 1557-9956
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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