The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2002 vol.13)
pp: 471-484
ABSTRACT
<p>Speculative prefetching has been proposed to improve the response time of network access. Previous studies in speculative prefetching focus on building and evaluating access models for the purpose of access prediction. This paper investigates a complementary area which has been largely ignored, that of performance modeling. We analyze the performance of a prefetcher that has uncertain knowledge about future accesses. Our performance metric is the <it>improvement in access time</it>, for which we derive a formula in terms of <it>resource</it> parameters (time available and time required for prefetching) and <it>speculative</it> parameters (probabilities for next access). We develop a prefetch algorithm to maximize the improvement in access time. The algorithm is based on finding the best solution to a <it>stretch knapsack problem</it>, using theoretically proven apparatus to reduce the search space. An integration between speculative prefetching and caching is also investigated.</p>
INDEX TERMS
Speculative prefetching, caching.
CITATION
Nor Jaidi Tuah, Mohan Kumar, Svetha Venkatesh, Sajal K. Das, "Performance Optimization Problem in Speculative Prefetching", IEEE Transactions on Parallel & Distributed Systems, vol.13, no. 5, pp. 471-484, May 2002, doi:10.1109/TPDS.2002.1003857
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool