Data relocation and prefetching for programs with large data sets

Numerical applications frequently contain nested loop structures that process large arrays of data. The execution of these loop structures often produces memory preference 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 the cache conflict misses (1) (2), but this technique has a high execution overhead since it does the copy operations entirely in software.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Engineering, Electronics and Electrical

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Yamada, Yoji

Contributors dc:contributor

• Hwu, Wen-Mei W.

• Engineering, Electronics and Electrical
• Computer Science

Statement dc:rights

• Copyright 1995 Yamada, Yoji

Language dc:language

eng

Identifier

AAI9522189
(UMI)AAI9522189

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/23680