2703 search results - page 222 / 541 » Optimizing memory transactions |
136
click to vote
SIGMOD
2001
ACM
16 years 4 months ago
2001
ACM
Over the last decades, improvements in CPU speed have outpaced improvements in main memory and disk access rates by orders of magnitude, enabling the use of data compression techn...
151
click to vote
EUROPAR
2007
Springer
15 years 10 months ago
2007
Springer
We show empirically that some of the issues that affected the design of linear algebra libraries for distributed memory architectures will also likely affect such libraries for s...
136
click to vote
RT
2001
Springer
15 years 9 months ago
2001
Springer
: The performance of hardware-based interactive rendering systems is often constrained by polygon fill rates and texture map capacity, rather than polygon count alone. We present a...
139
Voted
ISSS
1999
IEEE
15 years 8 months ago
1999
IEEE
We present a new exploration and optimization method to select customized implementations for dynamic data sets, as encountered in telecom network, database and multimedia applica...
123
click to vote
ICLP
1993
Springer
15 years 8 months ago
1993
Springer
: Copy avoidance refers to the safe replacement, at compile time, of copying operations by destructive updates in single-assignment languages. Conceptually, the problem can be divi...