456 search results - page 9 / 92 » Compiler Optimizations for Improving Data Locality |
VLSID
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper introduces a dynamic layout optimization strategy to minimize the number of cycles spent in memory accesses in a cache-based memory environment. In this approach, a giv...
ICS
2005
Tsinghua U.
15 years 3 months ago
2005
Tsinghua U.
Previous studies have shown that array regrouping and structure splitting significantly improve data locality. The most effective technique relies on profiling every access to eve...
85
Voted
PLDI
2003
ACM
15 years 2 months ago
2003
ACM
Speculative execution, such as control speculation and data speculation, is an effective way to improve program performance. Using edge/path profile information or simple heuristi...
80
Voted
CASES
2005
ACM
14 years 11 months ago
2005
ACM
Horizontally partitioned data caches are a popular architectural feature in which the processor maintains two or more data caches at the same level of hierarchy. Horizontally part...
143
click to vote
PLDI
1993
ACM
15 years 1 months ago
1993
ACM
Data locality is critical to achievinghigh performance on large-scale parallel machines. Non-local data accesses result in communication that can greatly impact performance. Thus ...