3202 search results - page 361 / 641 » Memory access scheduling |
168
click to vote
DATE
2008
IEEE
16 years 1 months ago
2008
IEEE
In many applications string pattern matching is one of the most intensive tasks in terms of computation time and memory accesses. Network Intrusion Detection Systems and DNA Seque...
173
click to vote
LCN
2008
IEEE
16 years 1 months ago
2008
IEEE
— Bloom filters are a well known data structure for approximate set membership. Bloom filters are space efficient but require many independent hashes and consecutive memory acces...
137
click to vote
ICMCS
2006
IEEE
16 years 21 days ago
2006
IEEE
Modern multimedia applications possess a very dynamic use of the memory hierarchy depending on the actual input, therefore requiring run-time profiling techniques to enable optim...
162
click to vote
ISCA
2005
IEEE
16 years 8 days ago
2005
IEEE
As processor speeds increase and memory latency becomes more critical, intelligent design and management of secondary caches becomes increasingly important. The efficiency of curr...
143
click to vote
ISPASS
2005
IEEE
16 years 7 days ago
2005
IEEE
In this paper we study the properties of a new packet trace compression method based on clustering of TCP flows. With our proposed method, the compression ratio that we achieve i...