3202 search results - page 335 / 641 » Memory access scheduling |
196
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
It is becoming apparent that the next generation IP route lookup architecture needs to achieve speeds of 100Gbps and beyond while supporting both IPv4 and IPv6 with fast real-time ...
248
Voted
ANCS
2009
ACM
15 years 4 months ago
2009
ACM
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
165
click to vote
ISPAN
2008
IEEE
16 years 1 months ago
2008
IEEE
Data prefetching has been considered an effective way to mask data access latency caused by cache misses and to bridge the performance gap between processor and memory. With hardw...
146
click to vote
ATS
2005
IEEE
16 years 9 days ago
2005
IEEE
In this paper, we develop a method to analyze the probability of access failure in SRAM array (due to random Vt variation in transistors) by jointly considering variations in cell...
167
Voted
ACSAC
2004
IEEE
15 years 10 months ago
2004
IEEE
In current extensible monolithic operating systems, loadable kernel modules (LKM) have unrestricted access to all portions of kernel memory and I/O space. As a result, kernel-modu...