Sciweavers

1629 search results - page 208 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
ACSC
2001
IEEE
15 years 1 months ago
Alias Analysis On Type Inference For Class Hierarchy In Java
The integration of alias analysis with type information increases the precision of alias detection, especially for inheritance among classes. This paper presents a compile-time fl...
Jongwook Woo, Jean-Luc Gaudiot, Isabelle Attali, D...
ISLPED
2009
ACM
125views Hardware» more  ISLPED 2009»
15 years 4 months ago
Behavior-level observability don't-cares and application to low-power behavioral synthesis
Many techniques for power management employed in advanced RTL synthesis tools rely explicitly or implicitly on observability don’t-care (ODC) conditions. In this paper we presen...
Jason Cong, Bin Liu, Zhiru Zhang
SIGCOMM
2010
ACM
14 years 10 months ago
NapSAC: design and implementation of a power-proportional web cluster
Energy consumption is a major and costly problem in data centers. A large fraction of this energy goes to powering idle machines that are not doing any useful work. We identify tw...
Andrew Krioukov, Prashanth Mohan, Sara Alspaugh, L...
PLILP
1998
Springer
15 years 2 months ago
A Compiler for Rewrite Programs in Associative-Commutative Theories
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
Pierre-Etienne Moreau, Hélène Kirchn...
CF
2006
ACM
14 years 12 months ago
Intermediately executed code is the key to find refactorings that improve temporal data locality
The growing speed gap between memory and processor makes an efficient use of the cache ever more important to reach high performance. One of the most important ways to improve cac...
Kristof Beyls, Erik H. D'Hollander