Characteristics of program localities
Communications of the ACM
MIN—an optimal variable-space page replacement algorithm
Communications of the ACM
Empirical working set behavior
Communications of the ACM
The working set model for program behavior
Communications of the ACM
Comparison of the Working Sets and Bounded Locality Intervals of a Program
Proceedings of the International Workshop organized by the Commision of the European Communities on Modelling and Performance Evaluation of Computer Systems
Structure within Locality Intervals
Proceedings of the Third International Symposium on Measuring, Modelling and Evaluating Computer Systems
Cache memories for PDP-11 family computers
ISCA '76 Proceedings of the 3rd annual symposium on Computer architecture
Methodology and empirical results of program behaviour measurements
PERFORMANCE '80 Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation
Measurements of major locality phases in symbolic reference strings
SIGMETRICS '76 Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation
On reference string generation processes
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
More design data for stack architectures
ACM '82 Proceedings of the ACM '82 conference
Strategy-Independent Program Restructuring Based on Bounded Locality Intervals
Strategy-Independent Program Restructuring Based on Bounded Locality Intervals
Program behavior and load dependent system performance.
Program behavior and load dependent system performance.
Performance measurement of paging behavior in multiprogramming systems
ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
Compiler directed memory management policy for numerical programs
Proceedings of the tenth ACM symposium on Operating systems principles
| Hi-index | 0.00 |
The BLI-model of program behaviour is sometimes referred to as an exact measure of the locality structure of the programs. However, only limited experimental data is available of the applicability of the BLI-model. In this paper the characteristics of the BLI-model are studied with relatively large empirical data. References to code segments, data segments and references to paged data segments are used in the experiments. The good coverage percentages reported in earlier studies with data segments, are present in our data also. However, the code referencing behaviour turns out to be totally different. Typically only some 50% of the execution time is covered with BLI's of acceptable length. This is shown to be a consequence of occasional references to segments not belonging to the phase or joining the phase during the phase. The behaviour of paged data segments is typically nearer to the behaviour of the code segments than that of the data segments. The BLI-model is also compared with the VMIN-algorithm. A relatively close correspondence between reasonably long BLI's and the VMIN-sets is observed. In general, the results reported in this paper indicate, that the BLI-model can be used with data segments only, or when information concerning short stable phases of the execution is sufficient.