- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Improving performance by strategy-independent program...
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
Improving performance by strategy-independent program restructuring using bounded locality intervals Law, Bernard Ming-Ki
Abstract
An efficient strategy-independent program restructuring algorithm based on the empirical studies of phases and transitions in the symbolic reference strings of real programs is developed. The algorithm is formulated on the basis that the majority of the page faults occur during phase transitions. Thus emphasis is placed in grouping those relocatable blocks referenced during phase transitions in the same pages. Some parameters to characterize program behavior are also established. The purpose is to study the relationship between these parameters and the performance of the program. An experiment to compare the performance improvement of the proposed restructuring algorithm and other major existing algorithms is conducted. The performance indices chosen are the mean working set size and the page fault rate. The problem of data dependency, the cost as well as the portability of program restructuring procedures are discussed.
Item Metadata
Title |
Improving performance by strategy-independent program restructuring using bounded locality intervals
|
Creator | |
Publisher |
University of British Columbia
|
Date Issued |
1981
|
Description |
An efficient strategy-independent program restructuring algorithm based on the empirical studies of phases and transitions in the symbolic reference strings of real programs is developed. The algorithm is formulated on the basis that the majority of the page faults occur during phase transitions. Thus emphasis is placed in grouping those relocatable blocks referenced during phase transitions in the same pages. Some parameters to characterize program behavior are also established. The purpose is to study the relationship between these parameters and the performance of the program. An experiment to compare the performance improvement of the proposed restructuring algorithm and other major existing algorithms is conducted. The performance indices chosen are the mean working set size and the page fault rate. The problem of data dependency, the cost as well as the portability of program restructuring procedures are discussed.
|
Genre | |
Type | |
Language |
eng
|
Date Available |
2010-03-26
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.
|
DOI |
10.14288/1.0051822
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Campus | |
Scholarly Level |
Graduate
|
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.