Models of 2PL Algorithms with Timestamp Ordering for Distributed Transactions Concurrency Control
Svetlana Zhelyazkova Vasileva1, Aleksandar Petrov Milev2
1Svetlana Vasileva, College – Dobrich, Konstantin Preslavsky University of Shumen, Dobrich, Bulgaria.
2Aleksandar Milev, Faculty of Mathematics and Informatics, Konstantin Preslavsky University of Shumen, Shumen, Bulgaria.
Manuscript received on August 04, 2013. | Revised Manuscript received on August 26, 2013. | Manuscript published on September 05, 2013. | PP: 247-252 | Volume-3, Issue-4, September 2013. | Retrieval Number: D1847093413/2013©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In this paper simulation models of two-phase locking in distributed database systems are presented. A mechanism of timestamp ordering (―wait – die‖ method) is embedded in the modeling algorithms to prevent deadlocks. The results of running model of Centralized, Distributed and Primary copy Two-phase locking algorithms are gathered and analyzed and represented. The main characteristics of transaction processing in distributed database management systems such as throughput, response time and probability service are given.
Keywords: Simulation models, GPSS transactions, Distributed transactions, Two-phase locking, Timestamp ordering.