A deadlock is a situation in which two computer programs sharing the same resource are effectively preventing each other from accessing the resource, resulting in both programs ceasing to function. The earliest computer operating systems ran only one program at a time. Deadlock occurrence can be detected by the resource scheduler. It’s important to prevent a deadlock before it can occur. In computer science, deadlock prevention algorithms are used in concurrent programming when multiple processes must acquire more than one shared resource. As a result, none of the processes can obtain all the resources it needs, so all processes are blocked from further execution. A real-world example would be traffic, which is going only in one direction. Here, a bridge is considered a resource. So, when deadlock happens, it can be easily resolved if one car backs up. Several cars may have to be backed up if a deadlock situation occurs.

Suriya Stephen

46 resources

0

1

0

Like