Integrated Tracy Kimbrel * Pei Cao Parallel t Prefetching W. Felten I and Caching Anna R. Karlin* Kai Li$ Edward Introduction Prefetching improving and caching the are widely-used approaches for Model and algorithms model of the parallel prefetch- We consider performance of file systems. A recent the following ing problem. There is a two-level memory hierarchy: a cache of k data blocks and d disks. A program makes sequence, of refera known sequence, called a reference encesrl, rz, . . . rn to a set of m data blocks, If a reference hits in the cache, it takes one time unit. Otherwise, the missing block must be fetched from a disk, which study shows that it is important and proposed an algorithm that to integrate the two, performs well both in theory and in practice [2, I]. That study waa restricted to the case of a single disk. Here, we study integrated prefetching and caching strategies for multiple disks. The interaction between caching and prefetching is further complicated when a system has multiple disks, not only because it is possible to do multiple prefetches in parallel, but also because appropriate cache replacement strategies can alleviate the load imbalance
End of preview. The entire article is 2 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/integrated-parallel-prefetching-and-caching-CNtf0LfP3j
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Integrated parallel prefetching and caching
Kimbrel, Tracy; Cao, Pei; Felten, Edward W.; Karlin, Anna R.; Li, Kai
Follow ACM SIGMETRICS Performance Evaluation Review
, Volume 24 (1)
Association for Computing Machinery – May 15, 1996
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
