Stochastic Petri Net Analysis of Deadlock Detection Algorithms in Transaction Database Systems with Dynamic Locking | Zendy

I.-R. Chen | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Stochastic Petri Net Analysis of Deadlock Detection Algorithms in Transaction Database Systems with Dynamic Locking

Author(s) -

I.-R. Chen

Publication year - 1995

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/38.9.717

Subject(s) - petri net , computer science , stochastic petri net , deadlock , interval (graph theory) , database transaction , deadlock prevention algorithms , set (abstract data type) , workload , lock (firearm) , algorithm , two phase locking , reachability , transaction processing , concurrency control , distributed computing , real time computing , database , online transaction processing , programming language , mathematics , operating system , mechanical engineering , combinatorics , engineering

We develop stochastic Petri net (SPN) models to analyze the best time interval between two consecutive executions of periodic deadlock detection algorithms for two-phase locking database systems with dynamic locking. Our models can accurately estimate 'wait time per lock conflict' automatically and allow the best time interval to be determined as a function of workload intensities and database characteristics. A system designer can apply the SPN tools developed in the paper to choose the best deadlock detection strategy, continuous or periodic, to optimize system performance, when given a set of system characteristics.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research