111 search results - page 22 / 23 » Using Multiple Memory Access Instructions for Reducing Code ... |
VALUETOOLS
2006
ACM
13 years 11 months ago
2006
ACM
Cache locality optimization is an efficient way for reducing the idle time of modern processors in waiting for needed data. This kind of optimization can be achieved either on the...
EGH
2011
Springer
12 years 5 months ago
2011
Springer
Texture compression helps rendering by reducing the footprint in graphics memory, thus allowing for more textures, and by lowering the number of memory accesses between the graphi...
ICDT
2001
ACM
13 years 9 months ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
JPDC
2006
13 years 5 months ago
2006
The rapid development of space and computer technologies has made possible to store a large amount of remotely sensed image data, collected from heterogeneous sources. In particul...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In P2P systems, large volumes of data are declustered naturally across a large number of peers. But it is very difficult to control the initial data distribution because every use...