Heuristic prefetching I am studying heuristic prefetching…
0 reactions
Heuristic prefetching
I am studying heuristic prefetching and my notes say this:
'A calculation is performed for each object transmitted on the channel P\*T based on the probability of access P of the object and the average time T that will pass until the object appears on the broadcast channel. • If the value of the transmitted object is higher than that of the cache, then the object with the lower value is deleted from the cache.'
When they say that the value of the transmitted object is higher than that of the cache ,is he talking about the average access time of the cache (hit time)?
#technology
source
I am studying heuristic prefetching and my notes say this:
'A calculation is performed for each object transmitted on the channel P\*T based on the probability of access P of the object and the average time T that will pass until the object appears on the broadcast channel. • If the value of the transmitted object is higher than that of the cache, then the object with the lower value is deleted from the cache.'
When they say that the value of the transmitted object is higher than that of the cache ,is he talking about the average access time of the cache (hit time)?
#technology
source
| 3,000 mlx | |
| 4 | |
| 0 |