NDLI: Consensus in asynchronous systems where processes can crash and recover

Content Provider	IEEE Xplore Digital Library
Author	Hurfin, M. Mostefaoui, A. Raynal, M.
Copyright Year	1998
Description	Author affiliation: IRISA, Rennes, France (Hurfin, M.)
Abstract	The consensus problem is now well identified as being one of the most important problems encountered in the design and the construction of fault-tolerant distributed systems. This problem is defined as follows: processes have to reach a common decision, which depends on their inputs, despite failures. We consider the consensus problem in asynchronous distributed systems augmented with unreliable failure detectors. Several protocols have been proposed for these systems, when process crashes are assumed to be definitive. This paper addresses the consensus problem in a more practical asynchronous system model, namely in a context where processes can crash and recover. As a process crash entails the loss of its volatile memory, each process is equipped with a stable storage. So, to be efficient a consensus protocol has to log as few critical data as possible. The proposed protocol uses a new class of failure detectors suited to the crash/recovery model. It is particularly efficient when, whether there are crashes or not, the underlying failure detector makes few mistakes. Additionally, the proposed protocol tolerates message duplication and copes with some message losses.
Starting Page	280
Ending Page	286
File Size	120656
Page Count	7
File Format	PDF
ISBN	0818692189
ISSN	10609857
DOI	10.1109/RELDIS.1998.740510
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1998-10-20
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computer crashes Detectors Protocols Broadcasting Ash Electronic switching systems Context modeling Fault diagnosis Electrical capacitance tomography
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computer Networks and Communications Software Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Fault-tolerant Total Order Multicast to asynchronous groups

Atomic broadcast in asynchronous crash-recovery distributed systems

Computing global functions in asynchronous distributed systems prone to process crashes

Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems

On classes of problems in asynchronous distributed systems with process crashes

Fault-Tolerant Consensus in Unknown and Anonymous Networks

Crash-resilient time-free eventual leadership

Real-time fault-tolerant atomic broadcast

Consensus with Unknown Participants in Shared Memory

Consensus in asynchronous systems where processes can crash and recover

Similar Documents

Fault-tolerant Total Order Multicast to asynchronous groups

Atomic broadcast in asynchronous crash-recovery distributed systems

Computing global functions in asynchronous distributed systems prone to process crashes

Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems

On classes of problems in asynchronous distributed systems with process crashes

Fault-Tolerant Consensus in Unknown and Anonymous Networks

Crash-resilient time-free eventual leadership

Real-time fault-tolerant atomic broadcast

Consensus with Unknown Participants in Shared Memory

Consensus in asynchronous systems where processes can crash and recover