Question
In: Computer Science
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.
(b) Draw a Gantt chart showing preemptive PRIORITY scheduling.
(c) Draw a Gantt chart showing Highest Response Ratio Next (HRRN) scheduling.
(d) Draw a Gantt chart showing Round Robin (RR) (quantum = 4) scheduling.
Solutions
Expert Solution
I have performed the mentioned algorithms on given process details and acquired Gantt Chart is presented at final answer. I tried to explain in detail as much as possible to understand the logic behind every step. Images are according to the serial as given in the question.
venereology answered 1 year agoRelated Solutions
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)
Draw a Gantt chart showing First-Come-First-Served
(FCFS) scheduling for these jobs.
Draw a Gantt chart showing
preemptive PRIORITY scheduling.
Draw a Gantt chart showing Highest Response Ratio Next
(HRRN) scheduling.
Draw a...
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.
(b) Draw a Gantt chart
showing preemptive PRIORITY scheduling.
(c) Draw a Gantt chart showing
Highest Response Ratio Next (HRRN) scheduling.
(d) Draw a...
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...
An operating system uses the First-Come, First-Served (FCFS) CPU scheduling algorithm. Consider the following set of...
An operating system uses the
First-Come, First-Served (FCFS)
CPU scheduling algorithm.
Consider the following set of processes in this OS, with the
length of the CPU burst time given in milliseconds, and the shown
priority. A larger priority number implies a
higher priority. There is no
pre-emption.
The processes are assumed to have arrived in the order P1, P2,
P3, P4, P5, all at time 0.
Process
Burst Time
Priority
P1
2
2
P2
1
5
P3
4
1
P4...
Consider the following set of processes, with the length of the CPU burst given in milliseconds:...
Consider the following set of processes, with the length of the
CPU burst given in milliseconds:
Process
Burst Time
Priority
P1
2
2
P2
1
1
P3
8
4
P4
4
2
P5
5
3
The processes are assumed to have
arrived in the order P1, P2, P3,
P4, P5, all at time 0.
Draw four Gantt charts that illustrate the execution of these
processes using the following scheduling algorithms: FCFS, SJF, non
preemptive priority (a smaller priority number implies...
1. Consider the following set of processes, with the length of CPU burst and arrival time...
1. Consider the following set of processes, with the length of
CPU burst and arrival time given in
milliseconds.
Process
Burst time Priority
Arrival
Time
P1
10
3
0
P2
1
1
2
P3
2
4
4
P4
5
2
8
a)
Draw the Gantt chart that illustrates the execution of these
processes using the preemptive priority scheduling
algorithm (a smaller priority number implies a higher
priority).
b)
What...
Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:...
Consider the following set of processes, with the length of the
CPU-burst time given in milliseconds:
Process Burst
Time
P1 5
P2 3
P3 1
P4 7
P5 4
The processes are assumed to have arrived in the order
P1, P2, P3, P4, P5,
all at time 0.
If FCFS scheduling is used, what is the average turnaround time
of these processes?
Answer:
Consider the following set of processes, with the length of the
CPU-burst time given in milliseconds:
Process Burst
Time
P1 5
P2 3
P3 1
P4 7
P5 4 ...
Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:...
Consider the following set of processes, with the length of the
CPU-burst time given in milliseconds:
Process Arrival Time Burst Time
P1 0 5
P2 2 3
P3 3 2
P4 4 4
P5 5 3
a. Draw Gantt charts illustrating the execution of these
processes using SJF pre-emptive
b. What is the turnaround time of each process for each of the
scheduling algorithms
c. What is the waiting time of each process for each of the
scheduling algorithms
Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:...
Consider the following set of
processes, with the length of the CPU-burst time given in
milliseconds:
Process
Burst Time
Priority
Arrival
Time
P1
10
3
0
P2
1
1
12
P3
2
4
0
P4
1
5
0
P5
5
2
0
In the above table, a smaller priority
number implies a higher priority. Suppose that these processes are
scheduled by the priority policy with preemption.
Draw the Gantt chart (i.e., time chart) illustrating the
execution of these processes.
What...
There are 5 jobs that have to be scheduled in a two-machine job shop system. The...
There are 5 jobs that have to be scheduled in a two-machine job
shop system. The processing time and the sequence of the required
operations of these jobs on the two machines are shown in the table
below. For example, job A needs 6 hours on machine 1 (M1) and 4
hours on machine 2 (M2), and it has to be processed on M1 and then
M2. You have to use the shortest processing time (SPT) rule to
schedule the...
ADVERTISEMENT
ADVERTISEMENT
Latest Questions
- In general, teams can be described three ways. Name and define each.
- JAVASCRIPT: Please create an array of student names and another array of student grades. - Create...
- Topic - Construction: Structural, loads, tension 1.) Explain why pure tension members are the most efficient...
- Procter and Gamble (PG) paid an annual dividend of $ 1.62$1.62 in 2009. You expect PG...
- locate a recent case of online child pornography. Write a summary of the incident and describe...
- #Python 5. Write function called evaluate() that evaluates the following Python expressions or assignments as specified:...
- Suggest journal, research paper link reference. i need this as reference for writing a research with...
ADVERTISEMENT