An efficient deadlock prevention approach for service oriented transaction processing

Tang, Feilong; You, Ilsun; Yu, Shui; Wang, Cho-Li; Guo, Minyi; Liu, Wenlong

doi:10.1016/j.camwa.2011.07.063

Cited by 4 publications

(1 citation statement)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In recent years, many algorithms are proposed that support dynamic adjustment of serialization order found from transaction object attributes to deal with database' transactions conflicting and to resolve deadlocks [9]- [11]. These methods use importance of transaction and operation similarity and can ensure a very well real-time performance by minimizing transactions wasted restart, under circumstances of guaranteeing logical and temporal consistency of data.…”

Section: Introductionmentioning

confidence: 99%

Soft Computing for Database Deadlock Resolution

Darwish¹,

El-Zoghabi²,

Hassan³

2015

IJMO

View full text Add to dashboard Cite

Abstract-Distributed nature of transactions arising at different sites and needing resources from diverse locations pose various operational problems, such as deadlocks, concurrency and data recovery. A deadlock may occur when a transaction enters into wait state that request resource from other blocked transactions. Deadlock detection and resolving is very difficult in a distributed database system because no controller has complete and current information about the system and data dependencies. In this paper, an enhanced technique for deadlock resolution is presented, which minimizes the abortion or waiting of the selected victim transactions. The proposed system includes the use of fuzzy logic by creating a set of fuzzy rules in order to deal with criticalness and similarity attributes of transactions. By using these rules, fuzzy logic will try to provide an easy conflict resolution method between transactions to diminish transactions wasted restart, and guaranteeing temporal consistency of data and transactions. Furthermore, the presented deadlock handling algorithm does not detect any false deadlock or exclude any really existing deadlocks. Experimental results show performance of the recommended system benefits such as increase in commit rate and decrease in re-execution or waiting of the transactions.

show abstract

Section: Introductionmentioning

confidence: 99%