53 search results - page 10 / 11 » Explaining Dynamic Cache Partitioning Speed Ups |
PADS
2003
ACM
14 years 29 days ago
2003
ACM
There is a wide-spread usage of hardware design languages(HDL) to speed up the time-to-market for the design of modern digital systems. Verification engineers can simulate hardwa...
PRL
2002
13 years 7 months ago
2002
As a new pattern classification method, nearest feature line (NFL) provides an effective way to tackle the sort of pattern recognition problems where only limited data are availab...
PDCN
2004
13 years 9 months ago
2004
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...
MICRO
2006
IEEE
13 years 7 months ago
2006
IEEE
In the past few years, several research works have demonstrated that sampling can drastically speed up architecture simulation, and several of these sampling techniques are already...
OOPSLA
2004
Springer
14 years 1 months ago
2004
Springer
As improvements in processor speed continue to outpace improvements in cache and memory speed, poor locality increasingly degrades performance. Because copying garbage collectors ...