scientific article; zbMATH DE number 2080904

MaRDI QIDQ4473969zbMATH OpenFDO

Authors Bernadette Charron-Bost

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2234/22340010.htm

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)

Recommendations

• Distributed agreement in the presence of processor and communication faults
• Agreement in synchronous networks with ubiquitous faults
• Distributed consensus in the presence of sectional faults
• Distributed agreement in dynamic peer-to-peer networks
• Fault tolerant distributed majority commitment
• Fast fault-tolerant agreement algorithms
• Agreement in the presence of faults, on networks of bounded degree

Cited in

(23)

• Synchronous, with a chance of partition tolerance
• Synchronization and informational agreement in distributed computing systems
• scientific article; zbMATH DE number 1950669 (Why is no real title available?)
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• scientific article; zbMATH DE number 1445803 (Why is no real title available?)
• scientific article; zbMATH DE number 1950666 (Why is no real title available?)
• scientific article; zbMATH DE number 1950670 (Why is no real title available?)
• Reaching agreement on processor-group membership in synchronous distributed systems
• The customizable fault/error model for dependable distributed systems.
• Managed agreement: generalizing two fundamental distributed agreement problems
• scientific article; zbMATH DE number 5506092 (Why is no real title available?)
• Fast fault-tolerant agreement algorithms
• scientific article; zbMATH DE number 2087627 (Why is no real title available?)
• Asynchronous Fault-Tolerant Total Ordering Algorithms
• scientific article; zbMATH DE number 2013823 (Why is no real title available?)
• Fast and simple distributed consensus
• scientific article; zbMATH DE number 2090699 (Why is no real title available?)
• Two distributed problems involving Byzantine processes
• Contention-related crash failures: definitions, agreement algorithms, and impossibility results
• SOFSEM 2006: Theory and Practice of Computer Science
• The possibility and the complexity of achieving fault-tolerant coordination
• Optimal agreement in a scale-free network environment

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473969)