Deakin University
Browse
venkatesh-performanceoptimization-2002.pdf (369.98 kB)

Performance optimization problem in speculative prefetching

Download (369.98 kB)
journal contribution
posted on 2002-01-01, 00:00 authored by N Tuah, M Kumar, Svetha VenkateshSvetha Venkatesh, S Das
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 prefetehing) 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.

History

Journal

IEEE transactions on parallel and distributed systems

Volume

13

Issue

5

Pagination

471 - 484

Publisher

IEEE

Location

Piscataway, N. J.

ISSN

1045-9219

eISSN

1558-2183

Language

eng

Notes

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Publication classification

C1.1 Refereed article in a scholarly journal

Copyright notice

2002, IEEE