This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Performance Optimization Problem in Speculative Prefetching
May 2002 (vol. 13 no. 5)
pp. 471-484

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 improvement in access time, for which we derive a formula in terms of resource parameters (time available and time required for prefetching) and speculative 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 stretch knapsack problem, using theoretically proven apparatus to reduce the search space. An integration between speculative prefetching and caching is also investigated.

[1] M. Banâtre, V. Issarny, F. Leleu, and B. Charpiot, “Providing Quality of Service over the Web: A Newspaper-Based Approach,” Computer Networks, vol. 29, nos. 8-13, pp. 1457-1465, Sept. 1997.
[2] P. Cao, “Application-Controlled File Caching and Prefetching,” PhD thesis, Dept. of Computer Science, Princeton Univ., Jan. 1996.
[3] G.B. Dantzig, “Discrete Variable Extremum Problems,” Operations Research, vol. 5, pp. 266-277, 1957.
[4] E. Horowitz and S. Sahni, "Computing Partitions with Applications to the Knapsack Problem," J. ACM, vol 21, pp. 277-292, 1974.
[5] Z. Jiang and L. Kleinrock, “An Adaptive Network Prefetch Scheme,” IEEE J. Selected Areas in Comm., vol. 16, no. 3, pp. 1-11, Apr. 1998.
[6] J.J. Kistler, “Disconnected Operation in a Distributed File System,” PhD thesis, Carnegie Mellon Univ., May 1993.
[7] G.H. Kuenning, “Seer: Predictive File Hoarding for Disconnected Mobile Operation,” PhD thesis, Univ. of California, Los Angeles, 1997.
[8] H. Lei and D. Duchamp, “An Analytical Approach to File Prefetching,” Proc. USENIX Ann. Technical Conf., Jan. 1997.
[9] E.P. Markatos and C.E. Chronaki, “A Top-10 Approach to Prefetching on the Web,” Technical Report TR 173, ICS-FORTH, Greece, Aug. 1996.
[10] S. Martello and P. Toth, “An Upper Bound for the Zero-One Knapsack Problem and a Branch and Bound Algorithm,” European J. Operational Research, vol. 1, pp. 169-175, 1977.
[11] S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementation. John Wiley and Sons, 1990.
[12] V. Padmanabhan and J. Mogul, Using Predictive Prefetching to Improve World Wide Web Latency ACM SIGCOMM Computer Comm. Rev., vol. 26, no. 3, July 1996.
[13] R.H. Patterson, G. Gibson, E. Ginting, D. Stodolsky, and J. Zelenka, "Informed Prefetching and Caching," Proc. 15th ACM Symp. Operating Systems Principles, pp. 79-95, Dec. 1995.
[14] R. Sandberg, D. Goldberg, S. Kleiman, D. Walsh, and B. Lyon, “Design and Implementation of the Sun Network File System,” Proc. Summer 1985 USENIX Conf., pp. 119-130, June 1985
[15] P. Scheuermann, J. Shim, and R. Vingralek, “Watchman: A Data Warehouse Intelligent Cache Manager,” Proc. 22nd Int'l Conf. Very Large Data Bases, 1996.
[16] P. Scheuermann, J. Shim, and R. Vingralek, “A Case for Delay-Conscious Caching of Web Documents,” Computer Networks and ISDN Systems, vol. 29, nos. 8-13, pp. 997-1005, Sept. 1997.
[17] C.D. Tait, “A File System for Mobile Computing,” PhD thesis, Graduate School of Arts and Sciences, Columbia Univ., 1993.
[18] N.J. Tuah, M. Kumar, and S. Venkatesh, “Performance Modelling of Speculative Prefetching for Compound Requests in Low Bandwidth Networks,” Proc. Third ACM Int'l Workshop Wireless Mobile Multimedia, pp. 83-92, 2000.
[19] J.S. Vitter and P. Krishnan, “Optimal Prefetching via Data Compression,” Proc. IEEE 32nd Ann. Symp. Foundation of Computer Science, pp. 121-130, 1991.
[20] R.P. Wooster and M. Abrams, "Proxy Caching That Estimates Page Load Delays," Computer Networks and ISDN Systems, vol. 29, nos. 8-13, 1997, pp. 977-986.

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 and Distributed Systems, vol. 13, no. 5, pp. 471-484, May 2002, doi:10.1109/TPDS.2002.1003857
Usage of this product signifies your acceptance of the Terms of Use.