Sciweavers

1119 search results - page 19 / 224
» Computing in the Presence of Timing Failures
Sort
View
WDAG
2010
Springer
218views Algorithms» more  WDAG 2010»
13 years 5 months ago
Anonymous Asynchronous Systems: The Case of Failure Detectors
Abstract: Due the multiplicity of loci of control, a main issue distributed systems have to cope with lies in the uncertainty on the system state created by the adversaries that ar...
François Bonnet, Michel Raynal
ICNP
2005
IEEE
14 years 1 months ago
On Understanding of Transient Interdomain Routing Failures
The convergence time of the interdomain routing protocol, BGP, can last as long as 30 minutes [14,15]. Yet, routing behavior during BGP route convergence is poorly understood. BGP...
Feng Wang, Lixin Gao, Jia Wang, Jian Qiu
FAC
2010
121views more  FAC 2010»
13 years 4 months ago
Blaming the client: on data refinement in the presence of pointers
Data refinement is a common approach to reasoning about programs, based on establishing that te program indeed satisfies all the required properties imposed by an intended abstract...
Ivana Filipovic, Peter W. O'Hearn, Noah Torp-Smith...
IPPS
2006
IEEE
14 years 1 months ago
Fault tolerance with real-time Java
After having drawn up a state of the art on the theoretical feasibility of a system of periodic tasks scheduled by a preemptive algorithm at fixed priorities, we show in this art...
Damien Masson, Serge Midonnet
DSN
2004
IEEE
13 years 11 months ago
Proactive Recovery in Distributed CORBA Applications
Unanticipated runtime events, such as faults, can lead to missed deadlines in real-time systems. While it is not always possible to know when a fault will occur, we can sometimes ...
Soila M. Pertet, Priya Narasimhan