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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on computers Ročník C-30; číslo 5; s. 341 - 356
Hlavní autoři: Abu-Sufah, Kuck, Lawrie
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.05.1981
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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