Sciweavers

1547 search results - page 169 / 310
» Randomized Variable Elimination
Sort
View
130
Voted
ICS
1997
Tsinghua U.
15 years 5 months ago
Iteration Space Slicing and Its Application to Communication Optimization
Program slicing is an analysis that answers questions such as \Which statements might a ect the computation of variable v at statement s?" or \Which statements depend on the ...
William Pugh, Evan Rosser
103
Voted
PLDI
1996
ACM
15 years 5 months ago
Fast, Effective Dynamic Compilation
Dynamic compilation enables optimizations based on the values of invariant data computed at run-time. Using the values of these runtime constants, a dynamic compiler can eliminate...
Joel Auslander, Matthai Philipose, Craig Chambers,...
CODES
2007
IEEE
15 years 4 months ago
Pointer re-coding for creating definitive MPSoC models
Today's MPSoC synthesis and exploration design flows start abstract input specification model captured in a system level design language. Usually this model is created from a...
Pramod Chandraiah, Rainer Dömer
98
Voted
CAV
2004
Springer
108views Hardware» more  CAV 2004»
15 years 4 months ago
Functional Dependency for Verification Reduction
Abstract. The existence of functional dependency among the state variables of a state transition system was identified as a common cause of inefficient BDD representation in formal...
Jie-Hong Roland Jiang, Robert K. Brayton
85
Voted
ICS
1995
Tsinghua U.
15 years 4 months ago
Idiom Recognition in the Polaris Parallelizing Compiler
The elimination of induction variables and the parallelization of reductions in FORTRAN programs have been shown to be integral to performance improvement on parallel computers 7,...
William M. Pottenger, Rudolf Eigenmann