1550 search results - page 146 / 310 » Benchmarking for Graph Transformation |
136
click to vote
ICS
2009
Tsinghua U.
15 years 10 months ago
2009
Tsinghua U.
Several existing compiler transformations can help improve communication-computation overlap in MPI applications. However, traditional compilers treat calls to the MPI library as ...
159
click to vote
DAC
2004
ACM
16 years 4 months ago
2004
ACM
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
251
Voted
POPL
2009
ACM
16 years 4 months ago
2009
ACM
Garbage collectors are notoriously hard to verify, due to their lowlevel interaction with the underlying system and the general difficulty in reasoning about reachability in graph...
121
click to vote
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
Grid computing provides a very rich environment for scientific calculations. In addition to the challenges it provides, it also offers new opportunities for optimization. In this ...
113
click to vote
ASYNC
2001
IEEE
15 years 7 months ago
2001
IEEE
This paper presents a new approach to two-level hazardfree sum-of-products logic minimization. No currently available minimizers for single-output literal-exact two-level hazard-f...