131 search results - page 16 / 27 » The Complexity of Online Memory Checking |
IISWC
2008
IEEE
15 years 3 months ago
2008
IEEE
Commercial server applications remain memory bound on modern multiprocessor systems because of their large data footprints, frequent sharing, complex non-strided access patterns, ...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
72
Voted
CGF
1999
14 years 9 months ago
1999
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
EDBT
2008
ACM
15 years 9 months ago
2008
ACM
Modern enterprise data warehouses have complex workloads that are notoriously difficult to manage. An important problem in workload management is to run these complex workloads `o...
138
click to vote
CF
2011
ACM
13 years 9 months ago
2011
ACM
Dynamic Information Flow Tracking (DIFT) is a powerful technique that can protect unmodified binaries from a broad range of vulnerabilities such as buffer overflow and code inj...