Sciweavers

1686 search results - page 281 / 338
» Programs as polygraphs: computability and complexity
Sort
View
CF
2005
ACM
14 years 11 months ago
Dynamic loop pipelining in data-driven architectures
Data-driven array architectures seem to be important alternatives for coarse-grained reconfigurable computing platforms. Their use has provided performance improvements over micro...
João M. P. Cardoso
HPCA
2009
IEEE
15 years 10 months ago
Versatile prediction and fast estimation of Architectural Vulnerability Factor from processor performance metrics
The shrinking processor feature size, lower threshold voltage and increasing clock frequency make modern processors highly vulnerable to transient faults. Architectural Vulnerabil...
Lide Duan, Bin Li, Lu Peng
SIGMOD
2007
ACM
153views Database» more  SIGMOD 2007»
15 years 10 months ago
Scaling games to epic proportion
We introduce scalability for computer games as the next frontier for techniques from data management. A very important aspect of computer games is the artificial intelligence (AI)...
Walker M. White, Alan J. Demers, Christoph Koch, J...
IEEEPACT
2005
IEEE
15 years 3 months ago
HUNTing the Overlap
Hiding communication latency is an important optimization for parallel programs. Programmers or compilers achieve this by using non-blocking communication primitives and overlappi...
Costin Iancu, Parry Husbands, Paul Hargrove
SAC
2005
ACM
15 years 3 months ago
A hybrid approach for multiresolution modeling of large-scale scientific data
Simulations of complex scientific phenomena involve the execution of massively parallel computer programs. These simulation programs generate large-scale multidimensional data set...
Tina Eliassi-Rad, Terence Critchlow