5964 search results - page 19 / 1193 » A theory of speculative computation |
IEEEPACT
2002
IEEE
14 years 9 days ago
2002
IEEE
Optimizations performed at link time or directly applied to final program executables have received increased attention in recent years. Such low-level optimizations can benefit...
TC
2010
13 years 2 months ago
2010
Continued logarithms, as originally introduced by Gosper, represent a means for exact rational arithmetic, but their application to exact real arithmetic is limited by the uniquene...
IWPC
1999
IEEE
13 years 11 months 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...
HPCA
2011
IEEE
12 years 11 months ago
2011
IEEE
As the web becomes the platform of choice for execution of more complex applications, a growing portion of computation is handed off by developers to the client side to reduce net...
CGO
2003
IEEE
13 years 11 months 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...