z-logo
open-access-imgOpen Access
Soft Computing Impacts in Resolving Deadlock Issues
Publication year - 2020
Publication title -
international journal for innovative engineering and management research
Language(s) - English
Resource type - Journals
ISSN - 2456-5083
DOI - 10.48047/ijiemr/v09/i12/113
Subject(s) - deadlock , computer science , deadlock prevention algorithms , concurrency control , distributed computing , concurrency , database transaction , resource (disambiguation) , wait for graph , state (computer science) , transaction processing , database , computer network , theoretical computer science , algorithm , graph , graph database
Distributed nature of transactions arising at different sites and needing resources fromdiverse locations pose various operational problems, such as deadlocks, concurrency and datarecovery. A deadlock may occur when a transaction enters into wait state that request resource fromother blocked transactions. Deadlock detection and resolving is very difficult in a distributeddatabase system because no controller has complete and current information about the system anddata dependencies. In this paper, an enhanced technique for deadlock resolution is presented, whichminimizes the abortion or waiting of the selected victim transactions

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