Sciweavers

229 search results - page 39 / 46
» How Efficient Can Memory Checking Be
Sort
View
CORR
2010
Springer
74views Education» more  CORR 2010»
13 years 7 months ago
Data Partitioning for Parallel Entity Matching
Entity matching is an important and difficult step for integrating web data. To reduce the typically high execution time for matching we investigate how we can perform entity matc...
Toralf Kirsten, Lars Kolb, Michael Hartung, Anika ...
ICNP
2003
IEEE
14 years 28 days ago
Packet Classification Using Extended TCAMs
CAMs are the most popular practical method for implementing packet classification in high performance routers. Their principal drawbacks are high power consumption and inefficient...
Ed Spitznagel, David E. Taylor, Jonathan S. Turner
LISA
2007
13 years 10 months ago
Stork: Package Management for Distributed VM Environments
In virtual machine environments each application is often run in its own virtual machine (VM), isolating it from other applications running on the same physical machine. Contentio...
Justin Cappos, Scott M. Baker, Jeremy Plichta, Duy...
ASPLOS
2010
ACM
13 years 11 months ago
Butterfly analysis: adapting dataflow analysis to dynamic parallel monitoring
Online program monitoring is an effective technique for detecting bugs and security attacks in running applications. Extending these tools to monitor parallel programs is challeng...
Michelle L. Goodstein, Evangelos Vlachos, Shimin C...
IPPS
2008
IEEE
14 years 2 months ago
Software monitoring with bounded overhead
In this paper, we introduce the new technique of HighConfidence Software Monitoring (HCSM), which allows one to perform software monitoring with bounded overhead and concomitantl...
Sean Callanan, David J. Dean, Michael Gorbovitski,...