Reducing Cache Conflicts in Data Cache Prefetching Jin-Ho Lee, Min-Young Lee, Seong-Uk Choi, and Myong-Soon Park { i j h, lmy, csu, m y o n g s p } @ c s l a b l . k o r e a , ac. k r Computer Systems Laboratory Department of Computer Science Korea University Seoul, Korea Introduction As processor speed has increased dramatically in recent years, the gap between processor and memory speeds becomes the main cause o f degrading processor utilization. A cache memory is a well-known hardware mechanism used to reduce this gap. Caches, however, show poor performance on some programs such as scientific and engineering applications due to their high cache miss ratio. Data prefetching[1,3,4,5,6,8,9,10,1 1,12,15] is one of the effective solutions to this problem. This technique reduces cache miss penalty by generating prefetch requests to bring data before actually being used. The prefetched data are stored in the data cache or in the prefetch buffer. Cache prefetching[3,4,5,6] suffers from cache conflicts(called cache pollution) because the current and the future working sets coexist on the cache at the same time. These two working sets conflict with each other and cause cache misses. The
End of preview. The entire article is 7 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/reducing-cache-conflicts-in-data-cache-prefetching-Yft0dy3dDe
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Reducing cache conflicts in data cache prefetching
Lee, Jin-Ho; Lee, Min-Young; Choi, Seong-Uk; Park, Myong-Soon
Follow ACM SIGARCH Computer Architecture News
, Volume 22 (4)
Association for Computing Machinery – Sep 1, 1994
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
