Making fault-sensitive algorithms tolerate link failures

DOI10.1006/JPDC.1995.1126MaRDI QIDQ1900319zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 30 October 1995

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1995.1126

zbMATH Keywords

distributed algorithmsfault-sensitive algorithmsmessage complexity measure

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• On the impact of link faults on Byzantine agreement
• scientific article; zbMATH DE number 3990855
• Automatically increasing the fault-tolerance of distributed algorithms
• Simplifying fault-tolerance, providing the abstraction of crash failures
• Tolerating transient and intermittent failures

Cited in

(1)

• Automatically increasing the fault-tolerance of distributed algorithms

This page was built for publication: Making fault-sensitive algorithms tolerate link failures

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