Top 10 List of Week 07

1. Deadlock and Starvation
   Deadlock occurs when each process holds a resource and wait for other resource held by any other process and Starvation is the problem that occurs when high priority processes keep executing and low priority processes get blocked for indefinite time. This article gives us illustration about deadlock process and table of difference between Deadlock and Starvation.

2. Deadlock Characterization
   A deadlock occurs if the four Coffman conditions hold true. This website explain us 4 conditions clearly with an illustration, so we can easily understand.

3. Bankers Algorithm
   The bankers algorithm is a resource allocation and deadlock avoidance algorithm that tests for safety by simulating the allocation for predetermined maximum possible amounts of all resources, then makes an s-state check to test for possible activities, before deciding whether allocation should be allowed to continue. This article explains Banker’s Algorithm so clearly and some example of code for bankers algorithm.

4. Deadlock Prevention And Avoidance
   We can prevent Deadlock by eliminating any of the four conditions. This article gives us an explanation about how to prevent deadlock for each characteristic.

5. Race Conditions
   Race condition in software is an undesirable event that can happen when multiple entities access or modify shared resources in a system. This article explains race condition so clearly, because it explains about milestone, example of race condition, How to detect race condition in a program, etc.

6. Semaphore
   Semaphore is simply a variable that is non-negative and shared between threads. This article not only gives us an explanation about semaphore but also implementation of binary semaphore and counting semaphore in programming.

7. Petersons Algorithm in Process Synchronization
   Petersons Algorithm is used to synchronize two processes. This article gives us a problem that can be solved with peterson’s algorithm and solution in C-language.

8. Bounded Buffer Problem
   Bounded Buffer problem is generalized in terms of the Producer-Consumer problem. This article tell us about producer operation and consumer operation with pseudo code and some point to explain that code.

9. Readers-Writers Problem
   The readers-writers problem relates to an object such as a file that is shared between multiple processes. This article explains about reader process and writer process with pseudo-code, so we can have an illustration about that process.

10. Dining Philosophers Problem
    Dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them. This article gives us solution for this problem and some of the ways to avoid deadlock briefly .