Sciweavers

3202 search results - page 146 / 641
» Memory access scheduling
Sort
View
HIPEAC
2011
Springer
14 years 4 months ago
Decoupled zero-compressed memory
For each computer system generation, there are always applications or workloads for which the main memory size is the major limitation. On the other hand, in many cases, one could...
Julien Dusser, André Seznec
SIGCOMM
2000
ACM
15 years 8 months ago
Memory-efficient state lookups with fast updates
Routers must do a best matching pre x lookup for every packet solutions for Gigabit speeds are well known. As Internet link speeds higher, we seek a scalable solution whose speed ...
Sandeep Sikka, George Varghese
JSAC
2006
163views more  JSAC 2006»
15 years 4 months ago
Fast and Scalable Pattern Matching for Network Intrusion Detection Systems
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packets....
Sarang Dharmapurikar, John W. Lockwood
WOSP
2004
ACM
15 years 10 months ago
Collecting whole-system reference traces of multiprogrammed and multithreaded workloads
The simulated evaluation of memory management policies relies on reference traces—logs of memory operations performed by running processes. No existing approach to reference tra...
Scott F. Kaplan
HPDC
2005
IEEE
15 years 10 months ago
Adaptive data block scheduling for parallel TCP streams
Applications that use parallel TCP streams to increase throughput must multiplex and demultiplex data blocks over a set of TCP streams transmitting on one or more network paths. W...
Thomas J. Hacker, Brian D. Noble, Brian D. Athey