San Francisco, California, USA
Apr. 23, 2001 to Apr. 27, 2001
Previous studies in speculative prefetching focus on building and evaluating access models for the purpose of access prediction. This paper, on the other hand, investigates the performance of speculative prefetching. When prefetching is performed speculatively, there is bound to be an increase in the network load. Furthermore, the prefetched items must compete for space with existing cache occupants. These two factors - increased load and eviction of potentially useful cache entries - are considered in the analysis. We obtain the following conclusion: to maximise the improvement in access time, prefetch exclusively all items with access probabilities exceeding a certain threshold.
N.J. Tuah, M. Kumar, S. Venkatesh, "Effect of Speculative Prefetching on Network Load in Distributed Systems", IPDPS, 2001, Parallel and Distributed Processing Symposium, International, Parallel and Distributed Processing Symposium, International 2001, pp. 10042b, doi:10.1109/IPDPS.2001.924979