Commutativity-Based Concurrency Control for Abstract Data Types

IEEE Transactions on Computers

Volumn 37, Issue 12, 1988, Pages 1488-1505

  Weihl, William E ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Abstract data types; atomic transactions; concurrency control; dynamic atomicity; Intentons lists; local atomicity; locking; recovery; undo logs

Indexed keywords

AUTOMATA THEORY; COMPUTER SYSTEMS, DIGITAL--FAULT TOLERANT CAPABILITY;

ABSTRACT DATA TYPES; ATOMIC TRANSACTIONS; COMMUTATIVITY-BASED CONCURRENCY CONTROL; DATABASE SYSTEM FAULT TOLERANCE; GLOBAL AND LOCAL ATOMICITY;

DATABASE SYSTEMS;

EID: 0024136623     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.9728     Document Type: Article

References (32)

1. J. E. Allchin, “An architecture for reliable decentralized systems,” Ph.D. dissertation, Georgia Instit. Technol., Sept. 1983. Available as Tech. Rep. GIT-ICS-83/23.
2. C. Beeri et. al., “A concurrency control theory for nested transactions, “ in Proc. Second Annu. ACM Symp. Principles Distributed Compute., ACM, Montreal, P.Q., Canada, Aug. 1983, pp. 45-62.
3. P. A. Bernstein and N. Goodman, “Concurrency control in distributed database systems,” ACM Comput. Surveys, vol. 13, pp. 185-221, June 1981.
4. P. Bernstein, N. Goodman, and M.-Y. Lai, “Two part proof schema for database concurrency control,” in Proc. Fifth Berkeley Workshop Distributed Data Management Comput. Networks, Feb. 1981, pp. 71-84.
5. P. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Reading, MA: Addison-Wesley, 1987.
6. K. P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger, “The notions of consistency and predicate locks in a database system,” Commun. ACM, vol. 19, pp. 624-633, Nov. 1976.
7. J. Gray, “Notes on database operating systems, “ in Lecture Notes in Computer Science. Vol. 60: Operating Systems-An Advanced Course. Berlin, Germany: Springer-Verlag, 1978.
8. J. N. Gray et al., “The recovery manager of the System R database manager,” ACM Comput. Surveys, vol. 13, pp. 223-242, June 1981.
9. V. Hadzilacos, “A theory of reliability in database systems,” J. ACM, vol. 35, pp. 121-145, Jan. 1988.
10. M. Herlihy, N. Lynch, M. Merritt, and W. Weihl, “On the correctness of orphan elimination algorithms (preliminary report),” in Proc. Seventeenth Int. Symp. Fault-Tolerant Comput., IEEE, Pittsburgh, PA, July 1987.
11. H. F. Korth, “Locking primitives in a database system,” J. ACM, vol. 30, pp. 55-79, Jan. 1983.
12. H. T. Kung and J. T. Robinson, “On optimistic methods for concurrency control,” ACM Trans. Database Syst., vol. 6, pp. 213-226, June 1981.
13. B. Lampson, “Atomic transactions,” in Lecture Notes in Computer Science. Vol. 105: Distributed Systems: Architecture and Implementation, Goos and Hartmanis, Eds. Berlin, Germany: Springer-Verlag, 1981, pp. 246-265.
14. B. Liskov and R. Schiefler, “Guardians and actions: Linguistic support for robust, distributed programs,” ACM Trans. Programming Languages Syst., vol. 5, pp. 381-404, July, 1983.
15. B. Liskov, R. Scheifler, E. F. Walker, and W. Weihl, “Orphan detection” (extended abstract), in Proc. 17th Int. Symp. Fault-Tolerant Comput., IEEE, July 1987.
16. N. A. Lynch and M. R. Tuttle, “Hierarchical correctness proofs for distributed algorithms,” Tech. Rep. MIT/LCS/TR-387, MIT Lab. Comput. Sci., Apr. 1987.
17. N. A. Lynch and M. Merritt, “Introduction to the theory of nested transactions,” Tech. Rep. MIT-LCS-TR-367, Massachusetts Instit. Technol., 1986. Appeared in Proc. 1986 Int. Conf. Database Theory.
18. J. E. B. Moss, “Nested transactions: An approach to reliable distributed computing,” Ph.D. dissertation, Massachusetts Instit. Technol., 1981. Available as Tech. Rep. MIT/LCS/TR-260.
19. J. Moss, N. Griffeth, and M. Graham, “Abstraction in concurrency control and recovery management (revised),” Tech. Rep. COINS Tech. Rep. 86-20, Univ. Massachusetts, Amherst, May 1986.
20. B. J. Nelson, “Remote procedure call,” Ph.D. dissertation, Carnegie-Mellon Univ. Dep. Comput. Sci., May 1981. Available as CMU-CS-81-119.
21. P. E. O’Neil, “The escrow transactional method,” ACM Trans. Database Syst., vol. 11, pp. 405-430, Dec. 1986.
22. C. H. Papadimitriou, “The serializability of concurrent database updates,” J. ACM, vol. 26, pp. 631-653, Oct. 1979.
23. D. P. Reed, “Naming and synchronization in a decentralized computer system,” Ph.D. dissertation, Massachusetts Instit. Technol., 1978. Available as Tech. Rep. MIT/LCS/TR-205.
24. P. Schwarz, “Transactions on typed objects,” Ph.D. dissertation, CMU, Dec. 1984. Available as Tech. Rep. CMU-CS-84-166.
25. P. M. Schwarz and A. Z. Spector, “Synchronizing shared abstract types,” ACM Trans. Comput. Syst., vol. 2, pp. 223-250, Aug. 1984.
26. M. D. Skeen, “Crash recovery in a distributed database system,” Ph.D. dissertation, Univ. California, Berkeley, May 1982. Available as UCB/ERL M82/45.
27. A. Z. Spector et al., “Support for distributed transactions in the TABS prototype,” IEEE Trans. Software Eng., vol. SE-11, pp. 520-530, June 1985.
28. W. E. Weihl, “Specification and implementation of atomic data types,” Ph.D. dissertation, Massachusetts Instit. Technol., 1984. Available as Tech. Rep. MIT/LCS/TR-314.
29. —, “Local atomicity properties: Modular concurrency control for abstract data types,” ACM Trans. Programming Languages Syst., 1988, to be published.
30. W. Weihl and B. Liskov, “Implementation of resilient, atomic data types,” ACM Trans. Programming Languages Syst., Apr. 1985.
31. G. Weikum, “A theoretical foundation of multi-level concurrency control,” in Proc. Fifth ACM Symp. Principles Database Syst., 1986, pp. 31-42.
32. G. Weikum and H.-J. Schek, “Architectural issues of transaction management in multi-layered systems,” in Proc. Tenth Int. Conf. Very Large Data Bases, Singapore, Aug. 1984, pp. 454-465.