Modeling and Analysis of Distributed Database Concurrency Control Algorithms Using an Extended Petri Net Formalism

1985 ◽  
Vol SE-11 (10) ◽  
pp. 1225-1240 ◽  
Author(s):  
M.T. Ozsu
2021 ◽  
Vol 1754 (1) ◽  
pp. 012059
Author(s):  
Dongliang Zhang ◽  
Kaiwen Zhang ◽  
Liufeng Wang ◽  
Qinqin Hong

2010 ◽  
Vol 48 (9) ◽  
pp. 2563-2582 ◽  
Author(s):  
José Jean-Paul Zanlucchi De Souza Tavares ◽  
Thiago Augusto Saraiva

Author(s):  
Yuqi Chen ◽  
Tingxue Xu ◽  
Xiaotong Zhao ◽  
Cheng Lu

Aiming at the problem that the current WSoS mission modeling and analysis methods are difficult to describe the property of multi-state of each equipment system, combining with Petri net and Markov process, an O-PPN based mission thread modeling and analysis method is proposed in this paper. Based on the definition of WSoS, the mission of WSoS is formally described. To improve the traditional Petri net, an operation performance Petri net (O-PPN) is constructed, in order to meet the modeling needs of the general mission thread of the WSoS; and aiming at the problems of the performance degradation of the equipment system and the possible "ahead of time" state, the performance degradation model of the equipment system based on Markov is constructed. The corresponding state probability set is obtained by inputting the reliability parameters of each equipment system. And according to the requirements of each operation in the mission thread for the performance level of each equipment system and combined with the mission success and failure criteria of the combat task and operation, the mission success probability of the whole WSoS is calculated. Finally, the feasibility of the proposed method is verified by the simulation of the case.


2019 ◽  
Vol 1 (2) ◽  
pp. 26-40
Author(s):  
Dardina Tasmere ◽  
Md. Nazmus Salehin

Concurrency control mechanisms including the wait, time-stamp and rollback mechanisms have been briefly discussed. The concepts of validation in optimistic approach are summarized in a detailed view. Various algorithms have been discussed regarding the degree of concurrency and classes of serializability. Practical questions relating arrival rate of transactions have been presented. Performance evaluation of concurrency control algorithms including degree of concurrency and system behavior have been briefly conceptualized. At last, ideas like multidimensional timestamps, relaxation of two-phase locking, system defined prewrites, flexible transactions and adaptability for increasing concurrency have been summarized.


Sign in / Sign up

Export Citation Format

Share Document