Sciweavers

3202 search results - page 358 / 641
» Memory access scheduling
Sort
View
ISPASS
2008
IEEE
16 years 1 months ago
Pinpointing and Exploiting Opportunities for Enhancing Data Reuse
—The potential for improving the performance of data-intensive scientific programs by enhancing data reuse in cache is substantial because CPUs are significantly faster than me...
Gabriel Marin, John M. Mellor-Crummey
ANCS
2006
ACM
16 years 19 days ago
Advanced algorithms for fast and scalable deep packet inspection
Modern deep packet inspection systems use regular expressions to define various patterns of interest in network data streams. Deterministic Finite Automata (DFA) are commonly used...
Sailesh Kumar, Jonathan S. Turner, John Williams
ICA3PP
2009
Springer
15 years 11 months ago
Evaluating a Dependable Sharable Atomic Data Service on a Planetary-Scale Network
Abstract. Practical implementations of atomically consistent read/write memory service are important building blocks for higher level applications. This is especially true when dat...
Chryssis Georgiou, Nikolas Hadjiprocopiou, Peter M...
CC
2006
Springer
125views System Software» more  CC 2006»
15 years 10 months ago
Path-Based Reuse Distance Analysis
Abstract. Profiling can effectively analyze program behavior and provide critical information for feedback-directed or dynamic optimizations. Based on memory profiling, reuse dista...
Changpeng Fang, Steve Carr, Soner Önder, Zhen...
DSN
2006
IEEE
15 years 10 months ago
Efficiently Detecting All Dangling Pointer Uses in Production Servers
In this paper, we propose a novel technique to detect all dangling pointer uses at run-time that is efficient enough for production use in server codes. One idea (previously used ...
Dinakar Dhurjati, Vikram S. Adve