CSC 456 Spring 2012/10a AJ: Difference between revisions
Jump to navigation
Jump to search
| Line 2: | Line 2: | ||
==Intro== | ==Intro== | ||
==Methods== | ==Methods== | ||
===Fixed vs. Adaptive Sequential Prefetching=== | |||
Fixed sequential prefetching refers to prefetching of that occurs at a constant rate over time. Adaptive sequential prefetching, on the other hand, changes the rate of prefetching allowed over time. The prefetching rate is increased/decreased based on the count of successful prefetches. The rate is therefore dependent on workload and application (a start-up process will have a high rate of cold misses). While both methods improve efficiency, adaptive sequential prefetching is the most efficient as well as the most costly. (Dahlgren, Dubois) | |||
==Where they stand now== | ==Where they stand now== | ||
===Why?=== | ===Why?=== | ||
Revision as of 03:33, 13 April 2012
Prefetching and Consistency Models
Intro
Methods
Fixed vs. Adaptive Sequential Prefetching
Fixed sequential prefetching refers to prefetching of that occurs at a constant rate over time. Adaptive sequential prefetching, on the other hand, changes the rate of prefetching allowed over time. The prefetching rate is increased/decreased based on the count of successful prefetches. The rate is therefore dependent on workload and application (a start-up process will have a high rate of cold misses). While both methods improve efficiency, adaptive sequential prefetching is the most efficient as well as the most costly. (Dahlgren, Dubois)