14 search results - page 1 / 3 » Critical path reduction for scalar programs |
MICRO
1995
IEEE
13 years 8 months ago
1995
IEEE
TPDS
1998
13 years 4 months ago
1998
—In this paper, we introduce a runtime, nontrace-based algorithm to compute the critical path profile of the execution of message passing and shared-memory parallel programs. Our...
GLVLSI
2010
IEEE
13 years 7 months ago
2010
IEEE
For timing-driven or yield-driven designs, non-tree routing has become more and more popular and additional loops provide the redundant paths to protect against the effect of the ...
SPAA
2003
ACM
13 years 10 months ago
2003
ACM
Recent research on processor microarchitecture suggests using instruction criticality as a metric to guide hardware control policies. Fields et al. [3, 4] have proposed a directed...
IFM
2009
Springer
13 years 11 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...