53 search results - page 8 / 11 » Explaining Dynamic Cache Partitioning Speed Ups |
WAIFI
2010
Springer
14 years 23 days ago
2010
Springer
In the 1990s and early 2000s several papers investigated the relative merits of polynomial-basis and normal-basis computations for F2n . Even for particularly squaring-friendly app...
ASPLOS
2009
ACM
14 years 8 months ago
2009
ACM
Miss rate curves (MRCs) are useful in a number of contexts. In our research, online L2 cache MRCs enable us to dynamically identify optimal cache sizes when cache-partitioning a s...
JAVA
1999
Springer
13 years 12 months ago
1999
Springer
As Java technology matures, an increasing number of applications that have traditionally been the domain of languages such as C++ are implemented in Java. Many of these applicatio...
TON
2002
13 years 7 months ago
2002
Popular content is frequently replicated in multiple servers or caches in the Internet to offload origin servers and improve end-user experience. However, choosing the best server ...
ISCA
2002
IEEE
13 years 7 months ago
2002
IEEE
Traditional vector architectures have shown to be very effective for regular codes where the compiler can detect data-level parallelism. However, this SIMD parallelism is also pre...