Openly accessible

A performance model of speculative prefetching in distributed information systems

Tuah, N. J., Kumar, M. and Venkatesh, S. 1999, A performance model of speculative prefetching in distributed information systems, in IPPS/SPDP 1999 : Proceedings of the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, IEEE, New York, N. Y., pp. 75-80.

Attached Files
Name Description MIMEType Size Downloads
venkatesh-aperformance-1999.pdf Published version application/pdf 278.36KB 9

Title A performance model of speculative prefetching in distributed information systems
Author(s) Tuah, N. J.
Kumar, M.
Venkatesh, S.
Conference name International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing (13th/10th : 1999 : San Juan, Puerto Rico)
Conference location San Juan, Puerto Rico
Conference dates 12-16 Apr. 1999
Title of proceedings IPPS/SPDP 1999 : Proceedings of the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
Editor(s) [Unknown]
Publication date 1999
Conference series International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing
Start page 75
End page 80
Total pages 6
Publisher IEEE
Place of publication New York, N. Y.
Keyword(s) Australia
data compression
distributed information systems
government
markov processes
operating systems
predictive models
prefetching
scholarships
tree graphs
Summary 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 modelling. We use improvement in access time as the performance metric, 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). The performance maximization problem is expressed as a stretch knapsack problem. We develop an algorithm to maximize the improvement in access time by solving the stretch knapsack problem, using theoretically proven apparatus to reduce the search space. Integration between speculative prefetching and caching is also investigated, albeit under the assumption of equal item sizes.
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.
ISBN 0769501435
ISSN 1063-7133
Language eng
Field of Research 089999 Information and Computing Sciences not elsewhere classified
Socio Economic Objective 970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category E1.1 Full written paper - refereed
Copyright notice ©1999, IEEE
Persistent URL http://hdl.handle.net/10536/DRO/DU:30044543

Document type: Conference Paper
Collections: School of Information Technology
Open Access Collection
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.

Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 2 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 23 Abstract Views, 9 File Downloads  -  Detailed Statistics
Created: Fri, 20 Apr 2012, 11:31:10 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.