2703 search results - page 321 / 541 » Optimizing memory transactions |
116
click to vote
COMPGEOM
2003
ACM
15 years 9 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
134
click to vote
DATE
2002
IEEE
15 years 9 months ago
2002
IEEE
: A new technique is presented in this paper to improve the efficiency of data scheduling for multi-context reconfigurable architectures targeting multimedia and DSP applications. ...
125
click to vote
IEEEPACT
1999
IEEE
15 years 8 months ago
1999
IEEE
Existing techniques can enhance the locality of arrays indexed by affine functions of induction variables. This paper presents a technique to localize non-affine array references,...
104
click to vote
DATE
2004
IEEE
15 years 7 months ago
2004
IEEE
The power consumed by the memory hierarchy of a microprocessor can contribute to as much as 50% of the total microprocessor system power, and is thus a good candidate for optimiza...
166
click to vote
TIC
2000
Springer
15 years 7 months ago
2000
Springer
Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a ...