Performance optimization problem in speculative prefetching Tuah, Nor Jaidi, Kumar, Mohan, Venkatesh, Svetha and Das, Sajal K. 2002, Performance optimization problem in speculative prefetching, IEEE transactions on parallel and distributed systems, vol. 13, no. 5, pp. 471-484, doi: 10.1109/TPDS.2002.1003857. Attached Files Name Description MIMEType Size Downloads venkatesh-performanceoptimization-2002.pdf Published version application/pdf 369.97KB 86 Title Performance optimization problem in speculative prefetching Author(s) Tuah, Nor Jaidi Kumar, Mohan Venkatesh, Svetha orcid.org/0000-0001-8675-6631 Das, Sajal K. Journal name IEEE transactions on parallel and distributed systems Volume number 13 Issue number 5 Start page 471 End page 484 Publisher IEEE Place of publication Piscataway, N. J. Publication date 2002 ISSN 1045-9219 1558-2183 Keyword(s) caching speculative prefetching Summary 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. 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. Language eng DOI 10.1109/TPDS.2002.1003857 Field of Research 080503 Networking and Communications Socio Economic Objective 890205 Information Processing Services (incl. Data Entry and Capture) HERDC Research category C1.1 Refereed article in a scholarly journal Copyright notice ©2002, IEEE Free to Read? Yes Persistent URL http://hdl.handle.net/10536/DRO/DU:30044249 Document type: Journal Article Collections: School of Information Technology Open Access Collection Related Links Link Description Connect to published version (restricted access) Go to link with your DU access privileges     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 Thu, 05 Apr 2012, 16:00:50 EST Wed, 18 Apr 2012, 15:39:47 EST Wed, 18 Apr 2012, 15:40:46 EST Wed, 18 Apr 2012, 15:49:58 EST Mon, 30 Apr 2012, 10:52:25 EST Tue, 01 May 2012, 13:55:50 EST Fri, 13 Jun 2014, 13:42:09 EST Tue, 06 Sep 2016, 18:37:59 EST Sat, 17 Jun 2017, 03:09:51 EST Tue, 05 Dec 2017, 12:30:54 EST Fri, 07 Sep 2018, 15:50:25 EST Filtered Full Citation counts:   Cited 3 times in TR Web of Science Cited 4 times in Scopus Search Google Scholar Access Statistics: 327 Abstract Views, 86 File Downloads  -  Detailed Statistics Created: Thu, 05 Apr 2012, 16:00:50 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.