venkatesh-effectof-2001.pdf (288.98 kB)
Effect of speculative prefetching on network load in distributed systems
conference contribution
posted on 2001-01-01, 00:00 authored by N Tuah, M Kumar, Svetha VenkateshSvetha VenkateshPrevious studies in speculative prefetching focus on building and evaluating access models for the purpose of access prediction. This paper on the other hand investigates the performance of speculative prefetching. When prefetching is performed speculatively, there is bound to be an increase in the network load. Furthermore, the prefetched items must compete for space with existing cache occupants. These two factors-increased load and eviction of potentially useful cache entries-are considered in the analysis. We obtain the following conclusion: to maximise the improvement in access time, prefetch exclusively all items with access probabilities exceeding a certain threshold.
History
Event
International Parallel and Distributed Processing Symposium (15th : 2001 : San Francisco, Calif.)Publisher
IEEELocation
San Francisco, Calif.Place of publication
Los Alamitos, Calif.Publisher DOI
Start date
2001-04-01End date
2001-04-30ISBN-13
9780769509907ISBN-10
0769509908Language
engNotes
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
E1.1 Full written paper - refereedCopyright notice
2001, IEEETitle of proceedings
IPDPS 2001 : 15th International Parallel and Distributed Processing Symposium : ProceedingsUsage metrics
Categories
No categories selectedLicence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC