Sciweavers

282 search results - page 17 / 57
» Reliability and Scheduling on Systems Subject to Failures
Sort
View
SIGSOFT
2004
ACM
15 years 10 months ago
PSE: explaining program failures via postmortem static analysis
In this paper, we describe PSE (Postmortem Symbolic Evaluation), a static analysis algorithm that can be used by programmers to diagnose software failures. The algorithm requires ...
Roman Manevich, Manu Sridharan, Stephen Adams, Man...
IPPS
2006
IEEE
15 years 4 months ago
A probabilistic approach for fault tolerant multiprocessor real-time scheduling
In this paper we tackle the problem of scheduling a periodic real-time system on identical multiprocessor platforms, moreover the tasks considered may fail with a given probabilit...
Vandy Berten, Joël Goossens, Emmanuel Jeannot
PODC
2004
ACM
15 years 3 months ago
Asynchronous group key exchange with failures
Group key exchange protocols allow a group of servers communicating over an asynchronous network of point-to-point links to establish a common key, such that an adversary which fu...
Christian Cachin, Reto Strobl
SIGMETRICS
2003
ACM
115views Hardware» more  SIGMETRICS 2003»
15 years 3 months ago
Measuring the effects of internet path faults on reactive routing
Empirical evidence suggests that reactive routing systems improve resilience to Internet path failures. They detect and route around faulty paths based on measurements of path per...
Nick Feamster, David G. Andersen, Hari Balakrishna...
DC
2006
14 years 10 months ago
Performing work in broadcast networks
We consider the problem of how to schedule t similar and independent tasks to be performed in a synchronous distributed system of p stations communicating via multiple-access chan...
Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Li...