1074 search results - page 79 / 215 » Parallelizing post-placement timing optimization |
177
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
214
click to vote
SC
2005
ACM
15 years 11 months ago
2005
ACM
In contrast to traditional terascale simulations that have known, fixed data inputs, dynamic data-driven (DDD) applications are characterized by unknown data and informed by dynam...
182
click to vote
EGH
2010
Springer
15 years 4 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
186
click to vote
IPPS
2007
IEEE
16 years 15 days ago
2007
IEEE
We present a scalable, hierarchical control system for the dynamic resource management of a distributed real-time embedded (DRE) system. This DRE is inspired by the DARPA Adaptive...
135
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
We propose a novel work partitioning technique, Image Layer Decomposition (ILD), designed specifically to support distributed real-time rendering on commodity clusters. ILD has s...