Skip to search formSkip to main contentSkip to account menu

Failure detector

In distributed computing, a failure detector is an application or a subsystem that is responsible for detection of node failures or crashes in a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
Chandra–Toueg consensus algorithmCrash (computing)Dijkstra PrizeDistributed computing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A model‐driven approach to detect faults in FOSS systems
Free and Open‐Source Software (FOSS) Linux distributions are among the most complex modern software systems. They are made of… 
2010
2010
Eventually linearizable shared objects
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems… 
2009
2009
Evolutionary Algorithm for Artificial Immune System Based Failure Detector Generation and Optimization
The development of an evolutionary algorithm and accompanying software for the generation and optimization of artificial-immune… 
2008
2008
Using asynchrony and zero degradation to speed up indulgent consensus protocols
Highly Cited
2007
Highly Cited
2007
A new adaptive accrual failure detector for dependable distributed systems
The detection of failures in distributed environments is a crucial part for developing dependable, robust, and self-healing… 
2007
2007
A simple distributed algorithm for the maintenance of a spanning tree
This work is devoted to the problem of spanning tree maintenance in the presence of crash failures in a distributed environment… 
2004
2004
Fault-tolerant group membership protocols using physical robot messengers
In this paper, we consider a distributed system that consists of a group of teams of worker robots that rely on physical robot… 
2004
2004
Semi-passive replication and Lazy Consensus
Review
2001
Review
2001
Mastering Agreement Problems in Distributed Systems
Nonblocking atomic commitment is a well-known agreement problem of practical interest to distributed-systems engineers and… 
1999
1999
The Timely Computing Base
Real-time behavior is materialized by timeliness specifications, which in essence call for synchronous system models. However… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)