Prepare Gantt Charts and Determine the Average Waiting Time
1. Classify the interaction among the processes on the basis if degree to which they are aware of each other's existence (i.e., processes totally unaware of each other, indirectly aware of each other, and Directly aware of each other). Also list the consequences of each.
2. a) Compare various CPU scheduling algorithms (particularly: FCFS, SJF, and RR) on the grounds of throughput, response time, overhead, mode (pre-emptive or non-pre-emptive), starvation factor, fairness level to certain processes.
b) Also, prepare Gantt charts and determine the average waiting time for the following set of processes using FCFS, SJF (non-pre-emptive) and RR (quantum=4 ms):
|
Process Name:
|
P1
|
P2
|
P3
|
P4
|
P5
|
P6
|
|
Burst Time (in ms):
|
5
|
12
|
7
|
2
|
10
|
4
|
3. Using an example, demonstrate how semaphores and monitors can be used to synchronize two or more cooperating processes in the system.
4. Consider the following Processes P1 and P2:
Above processes are incorporated with a memory variable turn common to both processes just for the sake of synchronization and that these two processes do not enter into their critical section at the same time.
State whether it as a requisite solution and that it satisfies the requirements of the solution to.