Data relocation and prefetching for programs with large data sets

Yoji Yamada, John Gyllenhall, Grant Haab, Wen mei Hwu

Research output: Contribution to specialist publicationArticle

Abstract

Numerical applications frequently contain nested loop structures that process large arrays of data. The execution of these loop structures often produces memory reference patterns that poorly utilize data caches. Limited associativity and cache capacity result in cache conflict misses. Also, non-unit stride access patterns can cause low utilization of cache lines. Data copying has been proposed and investigated in order to reduce cache conflict misses [1][2], but his technique has a high execution overhead since it performs the copy operations entirely in software. We propose a combined hardware and software technique called data relocation and prefetching which eliminates much of the overhead of data copying through the use of special hardware. Furthermore, by relocating the data while performing software prefetching, the overhead of copying the data can be reduced further. Experimental results for data relocation and prefetching are encouraging and show a large improvement in cache performance.

Original languageEnglish (US)
Pages118-127
Number of pages10
Volume7
No21
Specialist publicationProfessional Engineering
StatePublished - Dec 7 1994

ASJC Scopus subject areas

  • Mechanical Engineering

Fingerprint Dive into the research topics of 'Data relocation and prefetching for programs with large data sets'. Together they form a unique fingerprint.

  • Cite this