Performance Evaluation of WW and WD Concurrency Control Algorithms for Database Management, via Modeling by Colored Petri Net

Any concurrent transaction should be taken in database could lead to conflict. The conflict occurs due to incorrect values for the data which lead to interference in executed transaction which has been taken. The concurrency control algorithms, to insure the concurrent action many transactions has been designed to work concurrently with a common data. In this paper, Wound-Wait and Wait-Die concurrency control algorithms which are the part of preventing Deadlock techniques, has been modeled. Since the Colored Petri Net is one of the best methods in analyzing the concurrency control mechanism, modeling are shown using Colored Petri. Ater modeling the evaluation is carried out using parameters such as the number of transactions entering the system, the number of commands, and the number of relevant and irrelevant data between transactions, and the number of relevant data in transactions without irrelevant data, has been taken place. After evaluation, according to mentioned parameters, this result has been obtained, that Wound-Wait algorithm has much better time performance in comparison with the Wait-Die algorithm.