It is a situation in a computer when two or more processes wait for each other to finish and release the occupied resources, which does not happen eventually leading to the hanging or crashing of the two processes. Such problems occur in schedulers based on time shared computing models for multiprocessing when exclusive access to resources for processes is enabled. There are a few algorithms for prevention of a deadlock, for example, Banker’s Algorithm, Wait/Die and Wound/Wait algorithms.
Filed Under: What Is
Questions related to this article?
👉Ask and discuss on EDAboard.com and Electro-Tech-Online.com forums.
Tell Us What You Think!!
You must be logged in to post a comment.