Sciweavers

1294 search results - page 132 / 259
» FFT Compiler Techniques
Sort
View
DAC
2009
ACM
14 years 10 months ago
Optimal static WCET-aware scratchpad allocation of program code
Caches are notorious for their unpredictability. It is difficult or even impossible to predict if a memory access will result in a definite cache hit or miss. This unpredictabilit...
Heiko Falk, Jan C. Kleinsorge
HPCA
2005
IEEE
14 years 9 months ago
Software Directed Issue Queue Power Reduction
The issue logic of a superscalar processor dissipates a large amount of static and dynamic power. Furthermore, its power density makes it a hot-spot requiring expensive cooling sy...
Antonio González, Jaume Abella, Michael F. ...
POPL
2007
ACM
14 years 9 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
OSDI
2008
ACM
14 years 9 months ago
Binary Translation Using Peephole Superoptimizers
We present a new scheme for performing binary translation that produces code comparable to or better than existing binary translators with much less engineering effort. Instead of...
Sorav Bansal, Alex Aiken
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
14 years 8 months ago
Approximate Confidence Computation in Probabilistic Databases
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
Dan Olteanu, Jiewen Huang, Christoph Koch