Extending Resilient Objects Efficiently
Resilient objects are instances of distributed abstract data types that are tolerant to failures. Due to the distributed nature of resilient objects and the replication of data, potential for a high degree of concurrency exists within them. This paper introduces a new concurrency control algorithm, which achieves higher concurrency than conventional methods like two-phase locking. Objects are specified in a high level language, and the algorithm uses the specification to take advantage of the structure of resilient objects and to exploit semantic information about operations. This information is given in a high level specification language.
KeywordsMellon Cuted dOled
Unable to display preview. Download preview PDF.
- [Ber83]Bernstein, P. A. and Goodman N. The Failure and Recovery Problem for Replicated Databases, Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, Montreal, 1983, pp. 114–122.Google Scholar
- [Bir84a]Birman, K., Joseph, T., Râuchle, T., El abbadi, A. Implementing Fault-Tolerant Distributed Objects, submitted for publication, also available as Technical Report TR 84–594, Cornell University, Ithaca, May 1984.Google Scholar
- [Bir84b]Birman, K. Replication and Availability in ISIS, Technical Report, Cornell University, to appear Google Scholar
- [Gra78]Gray, J. N. Notes on Data Base Operating Systems, Lecture Notes in Computer Science 60, Springer Verlag, Berlin, 1978Google Scholar
- Ked83] Kedem, Z. M. and Silberschatz, A. Locking Protocols: From Exclusive to Shared Locks, JA CM Vol. 80, No 4 (October 88),787–804Google Scholar
- [Lyn82]Lynch, N. Concurrency Control for Resilient Nested Transactions M.I.T. EECS Department, August 1982.Google Scholar
- [Mos81b]Moss, J.E., Nested Transactions: An Approach to Reliable Distributed Computing, Ph.D. thesis, M.I.T. Dept. of EECS, available as M.I.T. Lab. for CS Tech. Report 260, April 1981.Google Scholar
- [Ne181]Nelson, B. Remote Procedure Call, Ph.D. thesis, Carnegie Mellon University, Computer Science Tech. Report CS-81–119, Pittsburgh, PA, 1981.Google Scholar
- [Sch83]Schlichting, R.D., Schneider, F.B. Fail-Stop Processors: An Approach to Designing Fault-Tolerant Computing Systems, TOCS, August 1983.Google Scholar
- [Ske81]Skeen, D., Nonblocking commit protocols, SIGMOD International Conference on Management of Data, Pittsburg, Penn., July 1981Google Scholar