« Back

Top 10 List of Week 07

1. Introduction of Process Synchronization
   A brief overview about process categorization, race condition, Peterson’s solution and semaphore.

2. Race Condition
   An explanation about the concept of race condition with an example of it in a multi-process program.

3. Resource Allocation Graph
   A simple explanation about how a Resource Allocation Graph can represent the state of the system. That is, the complete information about all the processes that are holding some resources or waiting for some resources.

4. The Critical Section Problem
   A little discussion about the definition of critical section, important properties for implementing critical section and a solution to implement critical section.

5. Peterson’s Solution
   A nice explanation about Peterson’s Solution for solving Critical Section Problem in detail using an example.

6. Semaphore
   An explanation about what a semaphore is, how do they work, also an example in C-language.

7. Classical Problems of Synchronization
   A brief overview about classical problems of synchronization along with the solutions to each problem.

8. Deadlock, Livestock and Starvation
   An introduction about what exactly Deadlock, Livelock and Starvation are, what condition that can lead to each of them, also the differences between them.

9. Deadlock, Livelock and Starvation Code Implementations
   A deeper undertanding about the concepts of Deadlock, Livelock and Starvation through examples in Java.

10. Banker’s Algorithm
    A detailed explanation about Banker’s Algorithm as a deadlock avoidance algorithm along with an example.