Classical Problems of Synchronization

Case Study Analyze the classical problems of synchronization with real time examples and possess the solutions for establishment of synchronization for the occurrence of critical section along with the implementation code either using semaphore or mutex locks.

CPU Scheduling Problems

Consider the following set of process, with the length of the CPU burst time given in milliseconds i) Draw grant chart illustrating process execution for all scheduling ii) Find Turn around time iii) Find Waiting time iv) Which scheduling algorithm result in minimum average waiting time? 1. Process Burst Time Priority P1 10 3 P2 1 1 P3 2 3 P4 1 4 P5 5 2 2. Process Arrival Time Burst Time Priority P1 1 2 1 P2 1 5 4 P3 0 1 3 P4 1 7 2 P5 0 4 5 Time Quantum = 2 3. Process Arrival Time Burst Time Priority P1 1 4 1 P2 1 6 4 P3 2 2 3 P4 2 8 2 Time Quantum = 1