Deadlocks

Deadlocks are well-known problems with concurrent programming. There are several types of deadlocks:

1. Starving deadlocks apply to an execution thread where it does not get the necessary input to move on.
    
2. Contention deadlocks happen when multiple shared resources are required by different execution threads, but they are distributed among these threads so that no one has all the resources necessary to move on.
    

Let's explore how NERWous C handle deadlocks.