department

Free access

Contemporary approaches to fault tolerance

Author:

Alex WrightAuthors Info & Claims

Communications of the ACM, Volume 52, Issue 7

Pages 13 - 15

https://doi.org/10.1145/1538788.1538794

Published: 01 July 2009 Publication History

All formats PDF

Abstract

Thanks to computer scientists like Barbara Liskov, researchers are making major progress with cost-efficient fault tolerance for Web-based systems.

Cited By

View all

Kumar MMolla A(2024)Sublinear Message Bounds of Authenticated Implicit Byzantine AgreementProceedings of the 25th International Conference on Distributed Computing and Networking10.1145/3631461.3631548(124-133)Online publication date: 4-Jan-2024
https://dl.acm.org/doi/10.1145/3631461.3631548
Kumar MMolla A(2024)Sublinear message bounds of authenticated implicit Byzantine agreementTheoretical Computer Science10.1016/j.tcs.2024.1148881022(114888)Online publication date: Dec-2024
https://doi.org/10.1016/j.tcs.2024.114888
Kumar MMolla A(2023)On the Message Complexity of Fault-Tolerant Computation: Leader Election and AgreementIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2023.3239993(1-12)Online publication date: 2023
https://doi.org/10.1109/TPDS.2023.3239993
Show More Cited By

Index Terms

Recommendations

Application-Aware Byzantine Fault Tolerance
DASC '14: Proceedings of the 2014 IEEE 12th International Conference on Dependable, Autonomic and Secure Computing

Byzantine fault tolerance has been intensively studied over the past decade as a way to enhance the intrusion resilience of computer systems. However, state-machine-based Byzantine fault tolerance algorithms require deterministic application processing ...
Fault Tolerance in Multiprocessor Systems Without Dedicated Redundancy

An algorithm called RAFT (recursive algorithm for fault tolerance) for achieving fault tolerance in multiprocessor systems is described. Through the use of a combination of dynamic space- and time- redundancy techniques, RAFT achieves fault tolerance in ...
Algorithm-Based Fault Tolerance for FFT Networks

Algorithm-based fault tolerance (ABFT) is a low-overhead system-level fault tolerance technique. Many ABFT schemes have been proposed in the past for fast Fourier transform (FFT) networks. In this paper, a new ABFT scheme for FFT networks is proposed. ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 52, Issue 7

Barbara Liskov: ACM's A.M. Turing Award Winner

July 2009

141 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/1538788

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 2009

Published in CACM Volume 52, Issue 7

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Department
Popular
Un-reviewed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
3,724
Total Downloads

Downloads (Last 12 months)81
Downloads (Last 6 weeks)7

Reflects downloads up to 12 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kumar MMolla A(2024)Sublinear Message Bounds of Authenticated Implicit Byzantine AgreementProceedings of the 25th International Conference on Distributed Computing and Networking10.1145/3631461.3631548(124-133)Online publication date: 4-Jan-2024
https://dl.acm.org/doi/10.1145/3631461.3631548
Kumar MMolla A(2024)Sublinear message bounds of authenticated implicit Byzantine agreementTheoretical Computer Science10.1016/j.tcs.2024.1148881022(114888)Online publication date: Dec-2024
https://doi.org/10.1016/j.tcs.2024.114888
Kumar MMolla A(2023)On the Message Complexity of Fault-Tolerant Computation: Leader Election and AgreementIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2023.3239993(1-12)Online publication date: 2023
https://doi.org/10.1109/TPDS.2023.3239993
Tian YJing D(2022)Towards an Automatic Test Generation Method for Systems of Systems Based on Fault Injection and Model-Based Systems EngineeringApplied Sciences10.3390/app12221186312:22(11863)Online publication date: 21-Nov-2022
https://doi.org/10.3390/app122211863
Kumar MMolla AMiller ACensor-Hillel K(2021)Brief AnnouncementProceedings of the 2021 ACM Symposium on Principles of Distributed Computing10.1145/3465084.3467949(259-262)Online publication date: 21-Jul-2021
https://dl.acm.org/doi/10.1145/3465084.3467949
Molla AShur D(2020)Smoothed Analysis of Leader Election in Distributed NetworksStabilization, Safety, and Security of Distributed Systems10.1007/978-3-030-64348-5_14(183-198)Online publication date: 18-Nov-2020
https://dl.acm.org/doi/10.1007/978-3-030-64348-5_14
Augustine JMolla APandurangan GNewport CKeidar I(2018)Sublinear Message Bounds for Randomized AgreementProceedings of the 2018 ACM Symposium on Principles of Distributed Computing10.1145/3212734.3212751(315-324)Online publication date: 23-Jul-2018
https://dl.acm.org/doi/10.1145/3212734.3212751
Skilton MHovsepian FSkilton MHovsepian F(2017)The Technology of the 4th Industrial RevolutionThe 4th Industrial Revolution10.1007/978-3-319-62479-2_2(29-68)Online publication date: 29-Nov-2017
https://doi.org/10.1007/978-3-319-62479-2_2
King VSaia J(2011)Breaking the O(n2) bit barrierJournal of the ACM (JACM)10.1145/1989727.198973258:4(1-24)Online publication date: 20-Jul-2011
https://dl.acm.org/doi/10.1145/1989727.1989732
King VSaia JRicha AGuerraoui R(2010)Breaking the O(n2) bit barrierProceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing10.1145/1835698.1835798(420-429)Online publication date: 25-Jul-2010
https://dl.acm.org/doi/10.1145/1835698.1835798
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Digital Edition

View this article in digital edition.

Digital Edition

Magazine Site

View this article on the magazine site (external)

Magazine Site

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Application-Aware Byzantine Fault Tolerance

Fault Tolerance in Multiprocessor Systems Without Dedicated Redundancy

Algorithm-Based Fault Tolerance for FFT Networks

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Digital Edition

Magazine Site

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations