Sciweavers

179 search results - page 34 / 36
» Performance debugging for distributed systems of black boxes
Sort
View
DSN
2002
IEEE
14 years 21 days ago
Reducing the Cost of Group Communication with Semantic View Synchrony
View Synchrony (VS) is a powerful abstraction in the design and implementation of dependable distributed systems. By ensuring that processes deliver the same set of messages in ea...
José Orlando Pereira, Luís Rodrigues...
ACSAC
2005
IEEE
14 years 1 months ago
Exploiting Independent State For Network Intrusion Detection
Network intrusion detection systems (NIDSs) critically rely on processing a great deal of state. Often much of this state resides solely in the volatile processor memory accessibl...
Robin Sommer, Vern Paxson
GECCO
2008
Springer
172views Optimization» more  GECCO 2008»
13 years 8 months ago
Empirical analysis of a genetic algorithm-based stress test technique
Evolutionary testing denotes the use of evolutionary algorithms, e.g., Genetic Algorithms (GAs), to support various test automation tasks. Since evolutionary algorithms are heuris...
Vahid Garousi
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
14 years 8 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 8 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...