Question

Consider the following set of jobs to be scheduled for execution on a single CPU system....

Consider the following set of jobs to be scheduled for execution on a single CPU system.

Job

Arrival Time

Burst (msec)

Priority

A

0

6

3 (Silver)

B

1

2

1 (Diamond)

C

3

5

3 (Silver)

D

5

3

4 (Bronze)

E

7

2

2 (Gold)

  

(a)     Draw a Gantt chart showing First-Come-First-Served (FCFS) scheduling , Premtive PRIORITY Sheduling, Highest Response ratio Next (HRRN) and Round Robin(quantum=4).

I need this in half hour

Homework Answers

Answer #1

Gantt Charts

1.FCFS

A B C D E

0-------------------6---------------------8----------------------13---------------------16------------------18

2. Preemptive Priority

A B A E A C D

0-------------2-------------4---------------7--------------9--------------10--------------15-------------18

3. Highest Response Ratio Next(HRRN)

Response ratio = (waiting time + service time)/service time

Upto 7 all jobs are arrived so A and B execute. ( Non preemtive)

RR(C) = (5+3)/5 = 1.6

RR(D)= (3+5)/3 = 8/3 = 2.6

RR(E) = (7+2)/2 = 9/2 = 4.5

A B E D C

0-------------------6---------------------8-------------------10---------------------13--------------------18

4. Round Robin(quantum = 4)

A B C D E A C

0-------------4--------------6---------------10-------------13------------15-------------17--------------18

Do ask if any doubt. Please up-vote.

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Consider the following set of jobs to be scheduled for execution on a single CPU system....
Consider the following set of jobs to be scheduled for execution on a single CPU system. Job Arrival Time Burst (msec) Priority A 0 6 3 (Silver) B 1 2 1 (Diamond) C 3 5 3 (Silver) D 5 3 4 (Bronze) E 7 2 2 (Gold)    (a)     Draw a Gantt chart showing First-Come-First-Served (FCFS) scheduling for these jobs. [3 Marks] Answer (a) 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16...
Refer to the information provided below: Refer to the information provided below: Process Burst Arrival-time Priority...
Refer to the information provided below: Refer to the information provided below: Process Burst Arrival-time Priority A 2 1 3 B 8 0 2 C 3 1 2 D 12 2 1 Note: A lower priority number indicates a higher priority For each of the following CPU scheduling algorithms, determine the turnaround and wait times for each process as well as the average wait and turnaround times. First Come First Serve Round Robin with quantum=2 ms (assume 1ms = 1...
The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Process Priority Burst...
The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Process Priority Burst Arrival P 1 8 15 0 P 2 3 20 0 P 3 4 20 20 P 4 4 20 25 P 5 5 545 P 6 5 15 55 Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. The scheduler will execute the highestpriority process. For processes with the same priority, a round-robin scheduler will be...
Process Burst Time Priority Arrival p1 8 15 0 p2 3 20 0 p3 4 20...
Process Burst Time Priority Arrival p1 8 15 0 p2 3 20 0 p3 4 20 20 p4 4 20 25 p5 5 5 45 p6 5 15 55 The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. The scheduler will execute the highest-priority process. For processes with the same priority, a round-robin scheduler will be used with a time...
The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each process is...
The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each process is assigned a numerical priority,with a higher number indicating a higher relative priority. The scheduler will execute the highest-priority process. For processes with the same priority, a round-robin scheduler will be used with a time quantum of 10 units. If a process is preempted by a higher-priority process, the preempted process is placed at the end of the queue. Process            Burst Time Arrival Time...
The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each process is...
The following processes are being scheduled using a preemptive, priority-based, round-robin scheduling algorithm. Each process is assigned a numerical priority,with a higher number indicating a higher relative priority. The scheduler will execute the highest-priority process. For processes with the same priority, a round-robin scheduler will be used with a time quantum of 10 units. If a process is preempted by a higher-priority process, the preempted process is placed at the end of the queue. Process            Burst Time Arrival Time...
What tools could AA leaders have used to increase their awareness of internal and external issues?...
What tools could AA leaders have used to increase their awareness of internal and external issues? ???ALASKA AIRLINES: NAVIGATING CHANGE In the autumn of 2007, Alaska Airlines executives adjourned at the end of a long and stressful day in the midst of a multi-day strategic planning session. Most headed outside to relax, unwind and enjoy a bonfire on the shore of Semiahmoo Spit, outside the meeting venue in Blaine, a seaport town in northwest Washington state. Meanwhile, several members of...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT