Reliable scheduling in a TMR database system

ACM Transactions on Computer Systems (TOCS)

Volumn 7, Issue 1, 1989, Pages 25-60

  Pittelli, Frank M ^a   Garcia Molina, Hector ^b  

^a UNITED STATES NAVAL ACADEMY   (United States)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

Byzantine agreement; state machine approach; transaction scheduling; triple modular redundancy

Indexed keywords

RELIABILITY; SCHEDULING;

MESSAGE BATCHING; NULL TRANSACTIONS; RELIABLE SCHEDULING; TRANSACTION PROCESSING; TRIPLE MODULAR REDUNDANCY;

DATABASE SYSTEMS;

EID: 0024606853     PISSN: 07342071     EISSN: 15577333     Source Type: Journal    
DOI: 10.1145/58564.59294     Document Type: Article

References (19)

1. Aghili, H. et al. A prototype for a highly available database system. Res. Rep. RJ-3755, IBM Research Laboratories, San Jose, Calif., Jan. 1983.
2. Cristian, F., and Strong, S. Atomic broadcast: From simple message diffusion to Byzantine agreement. Res. Rep. RJ-4540, IBM Research Laboratories, San Jose, Calif., Dec. 1984.
3. Diffie, W., and Hellman, M. New directions in cryptography. IEEE Trans. Inf. Theor. IT22 (Nov. 1976), 644–654.
4. Dolev, D., Halpern, J., Simons, B., and Strong, R. Fault-tolerant clock synchronization. In ACM Symposium on Principles of Distributed Computing (Aug. 1984). ACM, New York, 1984.
5. Dolev, D., and Strong, S. Polynomial algorithms for multiple processor agreement. In Proceedings of 14th ACM Symposium on Theory of Computing. ACM, New York, 1982, pp. 401–497.
6. Fischer, M. J. The consensus problem in unreliable distributed systems (a brief survey). Tech. Rep. YALEU/DCS/RR-273, Dept. of Computer Science, Yale Univ., New Haven, Conn., June 1983.
7. Garcia-Molina, H., Pittelli, F., and Davidson, S. Applications of Byzantine agreement in database systems. ACM Trans. Database Syst. 11, 1 (March 1986), 27–47.
8. Lamport, L. Using time instead of timeout for fault-tolerant distributed systems. ACM Trans. Program. Lang. Syst. 6, 2 (April 1984), 254–280.
9. Lamport, L., and Melliar-Smith, P. Byzantine clock synchronization. In ACM Symposium on Principles of Distributed Computing (Aug. 1984). ACM, New York, 1984.
10. Lamport, L., Shostak, R., and Pease, M. The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4, 3 (July 1982), 382–401.
11. Lundelius, J., And Lynch, N. A new fault tolerant algorithm for clock synchronization. In ACM Symposium on Principles of Distributed Computing (Aug. 1984). ACM, New York, 1984.
12. Lynch, N., Fischer, M., and Fowler, R. A simple and efficient Byzantine generals algorithm. In Proceedings of 2nd Annual IEEE Symposium on Reliability in Distributed Software and Database Systems (1982). IEEE, New York, 1982.
13. Pease, M., Shostak, R., and Lamport, L. Reaching agreement in the presence of faults. J. ACM 27, 2 (April 1980), 228–234.
14. Pittelli, F. Experimental analysis of a triple modular redundant database system. Ph.D. dissertation, Princeton Univ., Princeton, N.J., October 1986.
15. Pittelli, F., AND Garcia-Molina, H. Recovery in a triple modular redundant database system. In Proceedings of the 7th International Conference on Distributed Computing Systems (Berlin, Sept. 1987). pp. 514–520.
16. Schlichtung, R. D., and Schneider, F. B. Fail-stop processors: an approach to designing fault-tolerant computing systems. ACM Trans. Comput. Syst. 1, 3 (Aug. 1983), 222–238.
17. Schneider, F. Synchronization in distributed programs. ACM Trans. Program. Lang. Syst. 4, 2 (April 1982), 125–148.
18. Siewiorek, D. P. et al. A Case Study of C.mmp, C.m* and C.vmp—Experiences with fault-tolerance in multiprocessor systems. Proc. IEEE 66, 10 (1978), 1978), 1178–1199.
19. Siewiorek, D. P., AND Swarz, R. S. The Theory and Practice of Reliable System Design, Digital Press, 1982.