Assignment
1. What is thread? What is motivation to develop the multithreaded processes?
2. Provide two programming examples of multithreading giving improved performance over a single-threaded solution.
3. List the three multithreading models?
4. Suppose there are 5 jobs in the ready queue. Processes' arrival time and burst time are shown as below:
Process Arrival Time Burst Time
|
P1
|
0.0
|
11
|
|
P2
|
4.0
|
8
|
|
P3
|
5.0
|
5
|
|
P4
|
7.0
|
6
|
|
P5
|
9.0
|
1
|
All the processes are non-preemptive. Show your show solution in Gantt chart for SJF Scheduling and calculate the average waiting time.
5. Suppose there are 5 jobs in the ready queue. Processes' arrival time and burst time are shown as below:
Process Arrival Time Burst Time
|
P1
|
0.0
|
11
|
|
P2
|
4.0
|
8
|
|
P3
|
5.0
|
5
|
|
P4
|
7.0
|
6
|
|
P5
|
9.0
|
1
|
All the processes are preemptive. Show your show solution in Gantt chart for SJF Scheduling and calculate the average waiting time.