142 search results - page 13 / 29 » A Constant Propagation Algorithm for Explicitly Parallel Pro... |
IPPS
2008
IEEE
15 years 6 months ago
2008
IEEE
A file data model for algorithmic skeletons is proposed, focusing on transparency and efficiency. Algorithmic skeletons correspond to a high-level programming model that takes a...
EUROPAR
2000
Springer
15 years 3 months ago
2000
Springer
We present a compiler algorithm called BitValue, which can discover both unused and constant bits in dusty-deck C programs. BitValue uses forward and backward dataflow analyses, ge...
CGO
2006
IEEE
15 years 5 months ago
2006
IEEE
Explicit Data Graph Execution (EDGE) architectures offer the possibility of high instruction-level parallelism with energy efficiency. In EDGE architectures, the compiler breaks ...
87
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
131
click to vote
NFM
2011
14 years 6 months ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...