360 search results - page 35 / 72 » Speculative Computation in Multilisp |
ARC
2008
Springer
13 years 10 months ago
2008
Springer
We present an improved method for scheduling speculative data paths which relies on cancel tokens to undo computations in misspeculated paths. Performancewise, this method is consi...
POPL
1996
ACM
14 years 19 days ago
1996
ACM
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
IWPC
1999
IEEE
14 years 23 days ago
1999
IEEE
Automatic program comprehension is particularly useful when applied to sparse matrix codes, since it allows to abstract e.g. from specific sparse matrix storage formats used in th...
CGO
2003
IEEE
14 years 3 days ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
DAC
1994
ACM
14 years 17 days ago
1994
ACM
- This paper describes a symbolic formulation that allows incorporation of speculative operation execution (preexecution) in an exact control-dependent scheduling of arbitrary forw...