Brian M. Oki
Barbara H. Liskov
- 1.Alsberg, P. A., and Day, J. D. A Principle for Resilient Sharing of Distributed Resources. Prec. of the 2nd Internatiorlal Conference on Software Engineering, October, 1976, pp. 627-644. Also available in unpublished form as CAC Document number 202 Center for Advanced Computation University of Illinois, Urbana-Champaign, Itlinois 61801 by Alsberg, Benford, Day, and Grapa. Google Scholar
Digital Library
- 2.Bartlett, J. F. A NonStop Kernel. Proc. of the 8th ACM Symposium on Operating System Principles, SIGOPS Operating System Review, 15 5, December, 1981, pp. 22-29. Google ScholarDigital Library
- 3.Bemstein, P. A., and Goodman, N. The Failure and Recovery Problem for Replicated Databases~ Second ACM Symposium on the Principles of Distributed Computing, August, 1983, pp. 114-122. Google ScholarDigital Library
- 4.Birman, K. P., Joseph, T. A., Rauchle, T., and El Abbadi, A. "Implementing Fault-tolerant Distributed Objects'. IEEE Trans. on Software Engineering 11, 6 (June 1985), 502-508.Google Scholar
- 5.Birman, K. P. and Joseph, T. A. "Reliable Communication in the Presence of Failures". ACM Trans. on Computer ";ystems 5, 1 (February 1987), 47-76. Google ScholarDigital Library
- 6.Borg, A., Baumbach, J., and Glazer, S. A Message System Supporting Fault Tolerance. Proc. of the 9th ACM Symposium on Operating System Principles, SIGOPS Operating System Review, 17, 5, October, 1983, pp. 90-99. Google ScholarDigital Library
- 7.Borr, A.J. Transaction Monitoring in Encompass: Reliable Distributed Transaction Processing. Proc. of the Seventh International Conference on Very Large Data Bases, September, 1981, pp. 155-165.Google Scholar
- 8.Borr, A.J. Robustness to Crash in a Distributed Database: A Non Shared-Memory Multi-Processor Approach. Proc. of the Tenth International Conference on Very Large Data Bases, August, 1984, pp. 445.-453. Google ScholarDigital Library
- 9.Cooper, E. C. Replicated Distributed Programs. UCB/CSD 85/231, University of California, Berkeley, CA, May, 1985. Google ScholarDigital Library
- 10.Davies, C.T. "Data Processing Spheres of Control". IBM Systems Journal 17, 2 (February 78), 179-198. Google ScholarDigital Library
- 11.Eager, D. L., and Sevcik, K. C. "Achieving Robustness in Distributed Database Systems". ACM Trans. on Database Systems 8, 3 (September 1983), 354-381. Google ScholarDigital Library
- 12.El Abbadi, A., Skeen, D., and Cristian, F. An IFfficient, Fault- Tolerant Protocol for Replicated Data Management. Proc. of the 4th ACM SIGACT/SIGMOD Conference on Principles c)f Data Base Systems, 1985. Google ScholarDigital Library
- 13.El Abbadi, A., and Toueg, S. Maintaining Availability in Partitioned Replicated Databases. Proc. of the 5th ACM SIGACT/SIGMOD Conference on Principles of Data Base Systems, 1986. Google ScholarDigital Library
- 14.Eswaran, K. P., Gray, J. N., Lode, R. A., and "rraiger, 1. L. "The Notions of Consistency and Predicate Locks in a Database System", Comm. of the ACM 19, 11 (November 1976), 624-633. Google ScholarDigital Library
- 15.Fowler, R.J. Decentralized Object Finding Using Forwarding Addresses. 85-12-1, University of Washington, Dept. of Computer Science, Seattle, WA, December, 1985.Google Scholar
- 16.Gifford, D. K. Weighted Voting for Replicated Data. Proc. of the 7th ACM Symposium on Operating Systems Principles, SlGOPS Operating Systems Review, 13, 5, December, 1979, pp. 150-162. Google ScholarDigital Library
- 17.Gifford, D. K., and Donahue, J. E. Coordinating independent Atomic Actions. Proc. of IEEE CompCon85, February, 1985, pp. 92-95.Google Scholar
- 18.Gray, J. N., Lorie, R. A. Putzolu, G. F., and Traiger, i. L. Granularity of locks and degrees of consistency in a shared data base. In Modeling in Data Base Management Systems, G. M. Nijssen, Eds., Elsevier North-Holland, New York, 1976, pp. 365-394.Google Scholar
- 19.Gray, J. N. Notes on Database Operating Systems. In Lecture Notes in Computer Science 60, Goos and Hartmanis, Eds., Springer- Verlag Berlin, 1978, pp. 393-481. Google ScholarDigital Library
- 20.Henderson, C. Locating Migratory Objects in an Internet. M.I.T. Laboratory for Computer Science, Cambridge, MA, 1983.Google Scholar
- 21.Herfihy, M. P. "A Quorum-Consensus Replication Method for Abstract Data Types'. ACM Trans, on Computer Systems 4, 1 (February 1986), 32-53. Google ScholarDigital Library
- 22.Hwang, D.J. Constructing a Highly-Available Location Service for a Distributed Environment. Technical Report MIT/LCS/TR-410, M.I.T. Laboratory for Computer Science, Cambrid0e, MA, January, 1988. Google ScholarDigital Library
- 23.Ladin, R., Liskov, B., and Shrira, L. A Technique for Constructing Highly-Available Services. M.I,T. Laboratory for Computer Science, Cambridge, MA, January, 1988. To be published in A/gorithmica. Google ScholarDigital Library
- 24.Lamport, L., Shostak, R., and Pease, M. "The Byzantine Generals Problem'. ACM Trans. on Programming Languages and Systems 4, 3 (July 1982), 382-401. Google ScholarDigital Library
- 25.Lampson, B. W., and Sturgis, H. E. (;rash Recovery in a Distributed Data Storage System. Xerox Research Center, Palo Alto, Ca., 1979.Google Scholar
- 26.Liskov, B., and Scheifler, R. "Guardians and Actions: Linguistic Suppod for Robust Distributed Programs'. ACM Trans. on Programming Languages and Systems 5, 3 (July 1983), 381-404. Google ScholarDigital Library
- 27.Liskov, B., Curtis, D., Johnson, P., and Scheffler, R. Implementation of Argus. Pro~. of the Eleventh ACM Symposium on Operating Systems Principles, SIGOPS Operating Systems Review, 21,5, November, 1987, pp. 111-122. Google ScholarDigital Library
- 28.Liskov, B. "Distributed Programming in Argus'. Comm. of the ACM 31, 3 (March 1988), 300-312. Google ScholarDigital Library
- 29.Liskov, B., and Ladin, R. Highly-Available Distributed Services and Fault-Tolerant Distributed Garbage Colletion. Proc. of the Fifth ACM Symposium on the Principles of Distributed Computing, August, 1986. Google ScholarDigital Library
- 30.Moss, J. E. B. Nested Transactions: An Approacl~ to Reliable Distributed Computing. Technical Report MITtLCS,rl'R-260, M.I.T. Laboratory for Computer Science, June, 1981. Google ScholarDigital Library
- 31.Mullender, S., and Vitanyi, P. Distributed Match-Making for Processes in Computer Netwod~s---Preliminary Version. Proc, of the Fourth Sy~sium on the Principles of Distributed Computing, ACM, August, 1985. Google ScholarDigital Library
- 32.Oki, B. M. Viewstamped Replication for Highly-Available Distributed Systems. Ph.D. Th., Massachusetts Institute of Technology, L~boratory for Computer Science, Cambddge, MA, May 1988. Forthcoming.Google Scholar
- 33.Papadimitriou, C. H. "Sedalizability of Concurrent Database Updates". J. of the ACM 24, 4 (October 1979), 631-653. Google ScholarDigital Library
- 34.Schneider, F. B. Fail-Stop Processors. Digest of Papers from Spdng CompCon '83 26th IEEE Computer Society International Conference, March, 1983, pp. 66-70.Google Scholar
- 35.Skeen, D., and Wright, D. D. Increasing Availability in Partitioned Database Systems. TR 83-581, Dept. of Computer Science, Comell University, March, 1984. Google ScholarDigital Library
- 36.Stonebraker, M. "Concurrency Control and Consistency of Multiple Copies of Data in Distributed INGRES'. IEEE Trans. on -Software Engineering 5, 3 (May 1979), 188-194.Google Scholar
Index Terms
- Viewstamped Replication: A New Primary Copy Method to Support Highly-Available Distributed Systems
Recommendations
From viewstamped replication to byzantine fault tolerance
ReplicationThe paper provides an historical perspective about two replication protocols, each of which was intended for practical deployment. The first is Viewstamped Replication, which was developed in the 1980's and allows a group of replicas to continue to ...
Branch replication scheme: A new model for data replication in large scale data grids
Data replication is a practical and effective method to achieve efficient and fault-tolerant data access in grids. Traditionally, data replication schemes maintain an entire replica in each site where a file is replicated, providing a read-only model. ...
Comments