We present a thorough analysis of the memory behaviour of page caching and prefetching algorithms. The analysis is restricted to programs whose execution consists of iteration of a sequence of page accesses. Program activity is characterized in terms of utilization of system resources. A graphical model of program execution is used to describe both page placement in the primary memory and the actions of page fetch and replacement. The algorithms are compared from the point of view of a number of performance indexes that include program response time and utilization of the secondary memory system. Special attention is paid to transient program behaviour and the effects of the time necessary for the processor to control the disk activities of page fetch. The results of a large set of measurement experiments are used to validate the analytical model and acquire significant indications concerning the extent of the simplifying assumptions made in the theoretical analysis. The discussion of the relation to previous work makes special reference to two classes of algorithms that received much attention in the past, aggressive prefetching and informed prefetching.
|Autori interni:||DINI, GIANLUCA|
|Autori:||DINI G; LETTIERI G; LOPRIORE L|
|Titolo:||Caching and prefetching algorithms for programs with looping reference patterns|
|Anno del prodotto:||2006|
|Digital Object Identifier (DOI):||10.1093/comjnl/bxh140|
|Appare nelle tipologie:||1.1 Articolo in rivista|