2703 search results - page 422 / 541 » Optimizing memory transactions |
111
click to vote
IEEEPACT
2002
IEEE
15 years 8 months ago
2002
IEEE
Data parallel compilers have long aimed to equal the performance of carefully hand-optimized parallel codes. For tightly-coupled applications based on line sweeps, this goal has b...
130
click to vote
ESA
2001
Springer
15 years 7 months ago
2001
Springer
Suppose that a program makes a sequence of m accesses (references) to data blocks, the cache can hold k < m blocks, an access to a block in the cache incurs one time unit, and ...
123
click to vote
HPCA
2000
IEEE
15 years 7 months ago
2000
IEEE
Clustered microarchitectures are an effective approach to reducing the penalties caused by wire delays inside a chip. Current superscalar processors have in fact a two-cluster mic...
140
Voted
SC
2000
ACM
15 years 7 months ago
2000
ACM
This paper describes extensions to OpenMP that implement data placement features needed for NUMA architectures. OpenMP is a collection of compiler directives and library routines ...
110
Voted
SIGGRAPH
2000
ACM
15 years 7 months ago
2000
ACM
We present a method for creating texture over an arbitrary surface mesh using an example 2D texture. The approach is to identify interesting regions (texture patches) in the 2D ex...