Sciweavers

271 search results - page 30 / 55
» Bandwidth-Friendly Cache Hierarchy
Sort
View
SIGGRAPH
2009
ACM
14 years 4 months ago
RACBVHs: random-accessible compressed bounding volume hierarchies
We present a novel bounding volume hierarchy (BVH) compression and decompression method transparently supporting random access on the compressed BVHs. To support random access on ...
Tae-Joon Kim, Bochang Moon, Duksu Kim, Sung-Eui Yo...
VLSID
2009
IEEE
143views VLSI» more  VLSID 2009»
14 years 10 months ago
SACR: Scheduling-Aware Cache Reconfiguration for Real-Time Embedded Systems
Dynamic reconfiguration techniques are widely used for efficient system optimization. Dynamic cache reconfiguration is a promising approach for reducing energy consumption as well...
Weixun Wang, Prabhat Mishra, Ann Gordon-Ross
SC
2004
ACM
14 years 3 months ago
Big Wins with Small Application-Aware Caches
Large datasets, on the order of GB and TB, are increasingly common as abundant computational resources allow practitioners to collect, produce and store data at higher rates. As d...
Julio C. López, David R. O'Hallaron, Tianka...
ICPP
2003
IEEE
14 years 3 months ago
Enabling Partial Cache Line Prefetching Through Data Compression
Hardware prefetching is a simple and effective technique for hiding cache miss latency and thus improving the overall performance. However, it comes with addition of prefetch buff...
Youtao Zhang, Rajiv Gupta
ICS
2005
Tsinghua U.
14 years 3 months ago
The implications of working set analysis on supercomputing memory hierarchy design
Supercomputer architects strive to maximize the performance of scientific applications. Unfortunately, the large, unwieldy nature of most scientific applications has lead to the...
Richard C. Murphy, Arun Rodrigues, Peter M. Kogge,...