6568 search results - page 96 / 1314 » Reducing the Complexity of Reductions |
156
click to vote
ASPLOS
1994
ACM
15 years 10 months ago
1994
ACM
Several researchers have proposed algorithms for basic block reordering. We call these branch alignment algorithms. The primary emphasis of these algorithms has been on improving ...
205
click to vote
ISCA
1995
IEEE
15 years 9 months ago
1995
IEEE
This paper introduces dynamic self-invalidation (DSI), a new technique for reducing cache coherence overhead in shared-memory multiprocessors. DSI eliminates invalidation messages...
156
click to vote
CAINE
2004
15 years 7 months ago
2004
On the Internet, it is common practice to use a computer to provide web caching services. Such services aim to reduce network utilization and improve access time to a web page. Li...
175
click to vote
KGC
1997
Springer
15 years 10 months ago
1997
Springer
Rice’s Theorem says that every nontrivial semantic property of programs is undecidable. In this spirit we show the following: Every nontrivial absolute (gap, relative) counting p...
152
click to vote
ISCAS
2006
IEEE
16 years 9 days ago
2006
IEEE
— We propose the global Arnoldi algorithm for MIMO RLCG interconnect model order reductions. This algorithm is an extension of the standard Arnoldi algorithm for systems with mul...