14 search results - page 3 / 3 » Threshold counters with increments and decrements |
ICCD
2005
IEEE
14 years 2 months ago
2005
IEEE
Recent studies have shown that in highly associative caches, the performance gap between the Least Recently Used (LRU) and the theoretical optimal replacement algorithms is large,...
TC
2008
13 years 5 months ago
2008
Recent studies have shown that, in highly associative caches, the performance gap between the Least Recently Used (LRU) and the theoretical optimal replacement algorithms is large,...
CAL
2007
13 years 5 months ago
2007
—Several recently proposed techniques including CPR (Checkpoint Processing and Recovery) and NoSQ (No Store Queue) rely on reference counting to manage physical registers. Howeve...
CN
2008
13 years 5 months ago
2008
The timely detection that a monitored variable has crossed a given threshold is a fundamental requirement for many network management applications. A challenge is the detection of ...