Stephen Ponzio
- 1.H. Attiya, C. Dwork, N. Lynch, and L. Stockmeyer. Bounds on the time to reach agreement in the presence of timing uncertainty. Report TM-435, Laboratory for Computer Science, MIT, November 1990. Also in STOC 1991. Google Scholar
Digital Library
- 2.H. Attiya and N. A. Lynch. Time bounds for realtime process control in the presence of timing uncertainty. Proc. 10th IEEE Real-Time Systems Symposium, 1989, pp. 268-284. Also: Technical Memo MIT/LCS/TM-403, Laboratory for Compurer Science, MIT, July 1989.Google ScholarCross Ref
- 3.H. Attiya and M. Mavronicolas. Efficiency of asynchronous vs. semi-synchronous networks, the 28th annual Allerton Conference on Communication, Control and Computing, October 1990.Google Scholar
- 4.F. Cristian, H. Aghili, R. Strong and D. Dolev. Atomic broadcast: from simple message diffusion to Byzantine agreement. Proc. 15th Int. Conf. on Fault Tolerant Computing, 1985, pp. 1-7. Also: IBM Research Report R35244, revised October 1989.Google Scholar
- 5.B.A. Coan and C. Dwork. Simultaneity is harder than agreement. Proc. 5th IEEE Symp. on Re/M- bility in Distributed Software and Database Systems, 1986, pp. 141-150.Google Scholar
- 6.B. Coan and G. Thomas. Agreeing on a leader in real-time. Proc. 11th IEEE Real-Time Systems Symposium, 1990.Google ScholarCross Ref
- 7.R. DeMillo, N. A. Lynch and M. Merritt. Cryptographic protocols. Proc. 14th Annum ACM Symp. on Theory of Computing, May 1982, pp. 383-400. Google ScholarDigital Library
- 8.D. Dolev, C. Dwork and L. Stockmeyer. On the minimal synchronism needed for distributed consensus. Journal of the ACM, Vol. 34, No. 1 (January 1987), pp. 77-97. Google ScholarDigital Library
- 9.D. Dolev, R. Reischuk, and H. R. Strong. Eventual is earlier than immediate. Proceedings of the 23rd IEEE Syrup. on Foundations of Computer Science, 1982, pp. 196-203.Google ScholarDigital Library
- 10.D. Dolev and H. R. Strong. Authenticated algorithms for Byzantine agreement. SIAM JournM on Computing, Vol. 12, No. 3 (November 1983), pp. 656-666.Google Scholar
- 11.C. Dwork, N. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM, Vol. 35 (1988), pp. 288-323. Google ScholarDigital Library
- 12.C. Dwork and Y. Moses. Knowledge and common knowledge in Byzantine environments I: crash fail ures. Proc. 1st Conf. on Theoretical Aspects of Reasoning About Knowledge, Morgan-Kaufmann, Los Altos, CA, 1986, pp. 149-170; Information and Computation, to appear. Google ScholarDigital Library
- 13.M. Fischer and N. Lynch. A lower bound for the time to assure interactive consistency. Information Processing Letters, Voh 14, No. 4 (June 1982), pp. 183-186.Google ScholarCross Ref
- 14.M. Fischer, N. Lynch and M. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, Vol. 32, No. 2 (1985), pp. 374-382. Google ScholarDigital Library
- 15.A. Herzberg and S. Kutten. Efficient Detection of Message Forwarding Faults. Proc. 8th ACM Syrup. on Principles of Distributed Computing, 1989, pp. 339-353. Google ScholarDigital Library
- 16.L. Lamport, R. Shostak and M. Pease. The Byzantine generals problem. A CM Transaction on Prog. Lang. and Sys., Vol. 4, No. 3 (July 1982), pp. 382- 401. Google ScholarDigital Library
- 17.M. Merritt. Notes on the Dolev-Strong lower bound for Byzantine agreement. Unpublished manuscript, 1985.Google Scholar
- 18.M. Pease, R. Shostak and L. Lamport. Reaching agreement in the presence of faults. JournM of the ACM, Vol. 27, No. 2 (1980), pp. 228-234. Google ScholarDigital Library
- 19.S. Ponzio. The Real-time Cost of Timing Uncertainty: Consensus and Failure Detection. SM thesis, Massachusetts Institute of Technology, June 1991.Google ScholarCross Ref
- 20.B. Simons, J. L. Welch and N. Lynch. An overview of clock synchronization. Proceedings of IBM Fault-Tolerant Computing Workshop, March, 1986. Google ScholarDigital Library
- 21.R. Strong, D. Dolev and F. Cristian. New latency bounds for atomic broadcast. 11th IEEE Real- Time Systems Symposium, 1990.Google ScholarCross Ref
- 22.J. L. Welch and N. Lynch. A new fault-tolerant algorithm for clock synchronization. Information and Computation, Vol. 77, No. i (April 1988), pp. 1-36. Google ScholarDigital Library
Index Terms
- Consensus in the presence of timing uncertainty: omission and Byzantine failures (extended abstract)
Recommendations
Adaptive timeliness of consensus in presence of crash and timing faults
The @D-timed uniform consensus is a stronger variant of the traditional consensus and it satisfies the following additional property: every correct process terminates its execution within a constant time @D (@D-timeliness), and no two processes decide ...
Numerical approach for quantification of epistemic uncertainty
In the field of uncertainty quantification, uncertainty in the governing equations may assume two forms: aleatory uncertainty and epistemic uncertainty. Aleatory uncertainty can be characterised by known probability distributions whilst epistemic ...
Computing in the Presence of Timing Failures
ICDCS '06: Proceedings of the 26th IEEE International Conference on Distributed Computing SystemsTiming failures refer to a situation where the environment in which a system operates does not behave as expected regarding the timing assumptions, that is, the timing constraints are not met. In the immense body of work on the designing fault-tolerant ...
Comments