Nothing Special   »   [go: up one dir, main page]

skip to main content
10.5555/1809315.1809322guidebooksArticle/Chapter ViewAbstractPublication PagesBookacm-pubtype
chapter

Designing algorithms for dependent process failures

Published: 01 January 2003 Publication History

Abstract

No abstract available.

References

[1]
T. Chandra, V. Hadzilacos, and S. Toueg. TheWeakest Failure Detector for Solving Consensus. Journal of the ACM, 43(4): 685-722, July 1996.
[2]
A. Doudou and A. Schiper. Muteness Detectors for Consensus with Byzantine Processes. In Proceedings of the 17th ACM Symposium on Principle of Distributed Computing, page 315, Puerto Vallarta, Mexico, July 1998.
[3]
M. Hirt and U. Maurer. Complete Characterization of Adversaries Tolerable in Secure Multy-Party Computation. In ACM Symposium on Principles of Distributed Computing, pages 25-34, Santa Barbara, California, 1997.
[4]
F. Junqueira and K. Marzullo. Consensus for Dependent Process Failures. Technical report, UCSD, La Jolla, CA, September 2002. http://www.cs.ucsd.edu/users/flavio/Docs/Gen.ps.
[5]
I. Keidar and S. Rajsbaum. On the Cost of Fault-Tolerant Consensus When There Are No Faults - A Tutorial. Technical Report MIT-LCS-TR-821, MIT, May 2001.
[6]
D. Malkhi and M. Reiter. Byzantine Quorum Systems. In 29th ACM Symposium on Theory of Computing, pages 569-578, May 1997.
[7]
Y. Ren and J. B. Dugan. Optimal Design of Reliable Systems Using Static and Dynamic Fault Trees. IEEE Transactions on Reliability, 47(3): 234-244, December 1998.
[8]
P. Thambidurai and Y.-K. Park. Interactive Consistency with Multiple Failure Modes. In IEEE 7th Symposium on Reliable Distributed Systems, pages 93-100, Columbus, Ohio, October 1988.

Cited By

View all
  • (2014)A Language-Based Approach to Secure Quorum ReplicationProceedings of the Ninth Workshop on Programming Languages and Analysis for Security10.1145/2637113.2637117(27-39)Online publication date: 28-Jul-2014
  • (2014)Distributed computability in Byzantine asynchronous systemsProceedings of the forty-sixth annual ACM symposium on Theory of computing10.1145/2591796.2591853(704-713)Online publication date: 31-May-2014
  • (2011)A survey on some recent advances in shared memory modelsProceedings of the 18th international conference on Structural information and communication complexity10.5555/2032229.2032234(17-28)Online publication date: 26-Jun-2011
  • Show More Cited By

Index Terms

  1. Designing algorithms for dependent process failures
    Index terms have been assigned to the content through auto-classification.

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image Guide books
    Future directions in distributed computing: research and position papers
    January 2003
    204 pages
    ISBN:3540009124
    • Editors:
    • André Schiper,
    • Alex A. Shvartsman,
    • Hakim Weatherspoon,
    • Ben Y. Zhao

    Publisher

    Springer-Verlag

    Berlin, Heidelberg

    Publication History

    Published: 01 January 2003

    Qualifiers

    • Chapter

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 21 Sep 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2014)A Language-Based Approach to Secure Quorum ReplicationProceedings of the Ninth Workshop on Programming Languages and Analysis for Security10.1145/2637113.2637117(27-39)Online publication date: 28-Jul-2014
    • (2014)Distributed computability in Byzantine asynchronous systemsProceedings of the forty-sixth annual ACM symposium on Theory of computing10.1145/2591796.2591853(704-713)Online publication date: 31-May-2014
    • (2011)A survey on some recent advances in shared memory modelsProceedings of the 18th international conference on Structural information and communication complexity10.5555/2032229.2032234(17-28)Online publication date: 26-Jun-2011
    • (2010)Distributed programming with tasksProceedings of the 14th international conference on Principles of distributed systems10.5555/1940234.1940258(205-218)Online publication date: 14-Dec-2010
    • (2010)Concurrent computing and shellable complexesProceedings of the 24th international conference on Distributed computing10.5555/1888781.1888795(109-123)Online publication date: 13-Sep-2010
    • (2010)The topology of shared-memory adversariesProceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing10.1145/1835698.1835724(105-113)Online publication date: 25-Jul-2010
    • (2010)Threshold protocols in survivor set systemsDistributed Computing10.1007/s00446-010-0107-323:2(135-149)Online publication date: 1-Oct-2010
    • (2009)The disagreement power of an adversaryProceedings of the 28th ACM symposium on Principles of distributed computing10.1145/1582716.1582769(288-289)Online publication date: 10-Aug-2009

    View Options

    View options

    Get Access

    Login options

    Full Access

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media