Calton Pu
- [1] G.T. Almes, A.P. Black, E.D. Lazowska, and J.D. Noe. The Eden system: A technical review. IEEE Transactions on Software Engineering, SE-11(1):43-58, January 1985.Google Scholar
Digital Library
- [2] D. Barbara and H. Garcia-Molina. The demarcation protocol: A technique for maintaining linear arithmetic constraints in distributed database systems. In Proceedings of the International Conference in Extending Database Technology, Vienna, March 1991. Google ScholarDigital Library
- [3] P.A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems. Addison-Wesley Publishing Company, first edition, 1987. Google ScholarDigital Library
- [4] A.D. Birrell and B.J. Nelson. Implementing remote procedure calls. ACM Transactions on Computer Systems, 2(1):39-59, February 1984. Google ScholarDigital Library
- [5] P.K. Chrysanthis and K. Ramamritham. ACTA: The Saga continues. In Ahmed Elmagarmid, editor, Transaction Models for Advanced Applications. Morgan Kaufmann, 1991. Google ScholarDigital Library
- [6] P. Dasgupta, R.C. Chen, S. Menon, M.P. Pearson, R. Ananthanarayanan, U. Ramachandran, M. Ahamad, R.J. LeBlanc, W.F. Appelbe, J.M. Bernabeu-Auban, P.W. Hutto, M.Y.A. Khalidi, and C.J. Wilkenloh. The design and implementation of the clouds distributed operating system, Computing Systems, 3(1):11-46, Winter 1990.Google Scholar
- [7] J.N. Gray, R.A. Lorie, G.R. Putzolu, and I.L. Traiger. Granularity of locks and degrees of consistency in a shared data base. In Proceedings of the IFIP Working Conference on Modeling of Data Base Management Systems, pages 1-29, 1979.Google Scholar
- [8] M. Hsu and A. Silberschatz. Unilateral commit: A new paradigm for reliable distributed transaction processing. In Proceedings of the Seventh International Conference on Data Engineering, Kobe, Japan, February 1990. Google ScholarDigital Library
- [9] E. Levy, H. Korth, and A. Silberschatz. An optimistic commit protocol for distributed transaction management. In Proceedings of the 1991 ACM SIGMOD International Conference on Management of Data, Denver, Colorado, May 1991. Google ScholarDigital Library
- [10] B.H. Liskov and R.W. Scheifler. Guardians and Actions: Linguistic support for robust, distributed programs. In Proceedings of the Ninth Annual Symposium on Principles of Programming Languages, pages 7-19, January 1982. Google ScholarDigital Library
- [11] C. Pu. Generalized transaction processing with epsilon-serializability. In Proceedings of Fourth International Workshop on High Performance Transaction Systems, Asilomar, California, September 1991.Google Scholar
- [12] C. Pu and A. Leff. Replica control in distributed systems: An asynchronous approach. In Proceedings of the 1991 ACM SIGMOD International Conference on Management of Data, pages 377-386, Denver, May 1991. Google ScholarDigital Library
- [13] C. Pu and A. Leff. Autonomous transaction execution with epsilon-serializability. In Proceedings of 1992 RIDE Workshop on Transaction and Query Processing, Phoenix, February 1992. IEEE/Computer Society.Google ScholarCross Ref
- [14] K. Ramamrithan and C. Pu. A formal characterization of epsilon serializability. Technical Report CUCS-044-91, Department of Computer Science, Columbia University, 1991.Google Scholar
- [15] A. Sheth, Yungho Leu, and Ahmed Elmagarmid. Maintaining consistency of interdependent data in multidatabase systems. Technical Report CSD-TR-91-016, Computer Science Department, Purdue University, March 1991.Google Scholar
- [16] K.L. Wu, P.S. Yu, and C., Pu. Divergence control for epsilon-serializability. In Proceedings of Eighth International Conference on Data Engineering, pages 506-515, Phoenix, February 1992. IEEE/Computer Society. Google ScholarDigital Library
Index Terms
- Relaxing the limitations of serializable transactions in distributed systems
Recommendations
Extracting more concurrency from distributed transactions
OSDI'14: Proceedings of the 11th USENIX conference on Operating Systems Design and ImplementationDistributed storage systems run transactions across machines to ensure serializability. Traditional protocols for distributed transactions are based on two-phase locking (2PL) or optimistic concurrency control (OCC). 2PL serializes transactions as soon ...
Implementing Distributed Read-Only Transactions
This paper presents an efficient scheme for eliminating conflicts between distributed read-only transactions and distributed update transactions, thereby reducing synchronization delays. The scheme makes use of a multiversion mechanism in order to ...
Comments