Autonomous Transaction Managers in Responsive Computing
Transaction systems are designed to facilitate the design of applications in distributed, failure-prone environments. Typically, mechanisms are provided as part of the transaction management system to relieve the application designers of managing concurrent executions and unexpected failures. Additionally, providing adequate real-time responsiveness in such systems necessitates the distributed autonomous management of the transaction executions — due to the reason that a centralized approach would be inefficient and highly sensitive to the failure of a single site. Ensuring the logical correctness of concurrent transaction executions in terms of maintaining serializability in an environment consisting of several autonomous sites is a current research effort. While several schemes have been proposed that are sufficient to ensure serializability, the particular conditions necessary have not been made precise. We explore this question in an attempt to delineate those classes of concurrency control protocols that can be used at each local site in the context of autonomous transaction managers. Our research provides the characterization and techniques for integrating the transaction schedules arising from the autonomous sites in a manner similar to the approach used for centralized concurrency control.
KeywordsConcurrency Control Active Interval Serializable Execution Local Schedule Synchronization Protocol
Unable to display preview. Download preview PDF.
- 1.P.A. Bernstein, V. Hadzilacos and N. Goodman, Concurrency Control and Recovery in Database Systems, Addison-Wesley, Reading, MA, 1987.Google Scholar
- 2.Y. Breitbart, D. Georgakopolous, M. Rusinkiewicz and A. Silberschatz, “On Rigorous Transaction Scheduling,” IEEE Transactions on Software Engineering, 1991.Google Scholar
- 3.Y. Breitbart, A. Silberschatz and G.R. Thompson, “Reliable Transaction Management in a Multidatabase System,” In Proceedings of ACMSIGMOD International Conference on Management of Data, 1990.Google Scholar
- 4.J. Gray and A. Reuter, Transaction Processing: Concepts and Techniques, Morgan Kaufmann, San Mateo, CA, 1993.Google Scholar
- 6.S. Mehrotra, R. Rastogi, Y. Breitbart, H.F. Korth and A. Silberschatz, “The Concurrency Control Problem in Multidatabases: Characteristics and Solutions,” In Proceedings of ACM-SIGMOD International Conference on Management of Data, 1992.Google Scholar
- 7.C. Papadimitriou, “Serializability of Concurrent Database Updates,” Journal of the ACM, 26(4), 1979.Google Scholar
- 8.C. Papadimitriou, The Theory of Database Concurrency Control, Computer Science Press, Rockville, MD, 1986.Google Scholar
- 9.Real-Time Systems: International Journal of Time-Critical Computing Systems, 4(3), Special Issue on Real-Time Databases, Kluwer Press, 1992.Google Scholar
- 10.S. Son, editor, ACM SIGMOD Record: Special Issue on Real-Time Databases, ACM Press, 1988.Google Scholar
- 11.N. Soparkar, “Time-Constrained Transaction Management,” Ph.D. dissertation, Dept. of Computer Sciences, Univ. of Texas at Austin, 1993.Google Scholar