2. Consider the following five processes, with the length of the CPU-burst time given in milliseconds: Arrival Time Burst Time a) b) c) d) Process P1 P2 P3 P4 P5 0 1 1 2 3 Draw a timeline for each of the following scheduling algorithm. Shortest Job Next Round Robin(using a time quantum of 2 millisecond) First-come-First-Served (FCFS) Shortest Remaining time (SR 6 4 3 2 5 iv) Compute the waiting time and turnaround time for each job for above scheduling algorithm refer question 1 a) above. Compute the average waiting time and turnaround time for above scheduling algorithm refer question 1 a) above. Which scheduling algorithm gives the best result?

2. Consider the following five processes, with the length of the CPU-burst time given in milliseconds: Arrival Time Burst Time a) b) c) d) Process P1 P2 P3 P4 P5 0 1 1 2 3 Draw a timeline for each of the following scheduling algorithm. Shortest Job Next Round Robin(using a time quantum of 2 millisecond) First-come-First-Served (FCFS) Shortest Remaining time (SR 6 4 3 2 5 iv) Compute the waiting time and turnaround time for each job for above scheduling algorithm refer question 1 a) above. Compute the average waiting time and turnaround time for above scheduling algorithm refer question 1 a) above. Which scheduling algorithm gives the best result?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: Consider the following set of processes, with the length of the CPU burst given in seconds:…

A: Scheduling of processes is done to finish the work on time. Arrival Time is the time when the…

Q: Consider the following processes with their associated CPU burst times. The processes have entered…

A: a) First Come First Served (FCFS): Gantt Chart: P1 P2 P3 P4 P5 7 8 21 25 30 Average…

Q: onsider the following set of processes, with the length of the CPU burst time given in milliseconds:…

A: process --p1 burst time : 2 priority:(2*18)%5=1 p2 1 (1*18)%5=3…

Q: (c) Given the following processes, burst times and process priorities. Priority High Medium High…

A: Solution:-

Q: Consider the following set of processes, with the length of the CPU burst time given in…

A: Non-Preemptive SchedulingThe processes are scheduled as per their burst time with the least…

Q: Draw the corresponding Gantt diagrams for this scheduling algorithms; - First Come First Served.

A: Given table contains 5 processes from P1 to P5. Each process contains it's arrival time and Burst…

Q: Consider the following set of processes, with the length of the CPU-burst time given in…

Q: (c) Given the following processes, burst times and process priorities. Priority High Process Number…

A: We need to find the better algorithm out of the given two, for the given scenario.

Q: 1. Consider the following set of processes, with the length of the CPU burst given in milliseconds.…

A: a)Four Gantt Charts are as follows

Q: Question no 02: Consider the following set of processes, with the length of the CPU burst given in…

A: a. Gantt chart 1. FCFS -First Come First Served Scheduling Criteria: Arrival time Mode:…

Q: Consider the following set of processes, with the arrival times and the CPU burst times given in…

A: The Gantt chart for the given set of processes is given by: According to shortest remaining…

Q: * First Come First Serve (FCFS) and * Round Robin (RR) with quantum time = 3 Process Arrival Time…

A: Solve the given CPU scheduling problem

Q: Consider the following set of six processes, with the arrival times, CPU burst time (in…

A: Consider the following set of six processes, with the arrival times, CPU burst time (in…

Q: consider the following set of processes , with the length of the CPU burst given in milliseconds:…

A: Scheduling is the process in the Operating System by which the processes are selected that will be…

Concept explainers

Dynamic Multithreading

An algorithm that executes a single instruction in a uniprocessor system is called a serial algorithm. In the case of a multiprocessor computer system, multiple instructions are executed in parallel. A multithreaded algorithm is an algorithm that enables multiple instances of the code to be executed concurrently.Multithreading is a concept that allows the CPU to execute threads independently while sharing similar resources. It is an important CPU feature that works on the process. Thread is a sequence of instructions that executes in parallel with other threads. Because of multithreading, multiple tasks can be performed within a single process.

Question

2. Consider the following five processes, with the length of the CPU-burst time given in
milliseconds:
Arrival Time
Burst Time
a)
b)
c)
d)
Process
P1
P2
P3
P4
P5
0
1
1
2
3
Draw a timeline for each of the following scheduling algorithm.
Shortest Job Next
Round Robin(using a time quantum of 2 millisecond)
First-come-First-Served (FCFS)
Shortest Remaining time (SR
6
4
3
2
5
iv)
Compute the waiting time and turnaround time for each job for above scheduling
algorithm refer question 1 a) above.
Compute the average waiting time and turnaround time for above scheduling
algorithm refer question 1 a) above.
Which scheduling algorithm gives the best result?

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

Round robin:

FCFS:

SRJF:

Shortest job next:

Step 6

Step by step

Solved in 6 steps with 4 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Fill in blank Suppose that there is only one CPU and we have five processes P1, P2, P3, P4, P5 all arrived at time 0. Their burst time are 10, 1, 2, 1, 5 respectively, and their priority values are 2, 4, 3, 5, 1 respectively. None of these processes will perform I/O operations. Note that lower the priority value, higher the priority. According to priority scheduling algorithm, at time 8, it will be process ---------- that is running.
1
Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process Burst Time Priority P1 2 2 P2 P3 4 P4 3 2 P5 4 3 The processes are assumed to have arrived in the order P1 , P2 , P3 , P4 , P5 , all at time o. a) Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, nonpreemptive priority (a larger priority number implies a higher priority), and RR (quantum = 3). b) What is the turnaround time of each process for each of the scheduling algorithms in part a? c) What is the waiting time of each process for each of these scheduling algorithms im part a?
Solve the given problems A and B
Consider the following four processes with the length of CPU burst time in milliseconds (P1: 20, P2:15, P3:10, P4:5 ms). Calculate the average waiting time by using following algorithms FCFS ALGORITHM. 1. RR ROUND ROBIN (TIME QUANTUM 10 MS)
Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority P1 P2 P3 P4 Ps 2 2 1 1 8 4 4 2 5 3 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. a. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, nonpreemptive priority (a larger priority number implies a higher priority), and RR (quantum = 2). b. What is the turnaround time of each process for each of the scheduling algorithms in part a? What is the waiting time of each process for each of these schedul- ing algorithms? с. d. Which of the algorithms results in the minimum average waiting time (over all processes)?
Given in Table 1 is a set of five (5) processes with the priority, length of the CPU-burst time, and arrival time. Table 1 Process Arrival Time (ms) Burst Time (ms) Priority* P1 3 P2 1 2 1 P3 3 P4 7 P5 8 8 4. *Note: • A smaller priority number implies a higher priority. a) Compute the Waiting Time (WT) of each process in Table 1, and also compute their Average Waiting Time, for each of the following scheduling algorithms. i. Shortest Job First (SJF). ii. Pre-emptive Priority (PP) iii. Round Robin (RR) with quantum = 3 (ms).
Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process Burst Time Priority P1 1 3 P2 3 1 P3 2 5 P4 4 4 P5 5 2 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. Draw 2 Gantt charts that illustrate the execution of these processes using the following 2 scheduling algorithms: non-preemptive priority (a smaller priority number implies a higher priority), and RR (quantum = 1). What is the turnaround time of each process for each of the scheduling algorithms in part a? Explain why What is the waiting time of each process for each of these scheduling algorithms?Explain why
Question 9 2. Consider the following processes with arrival time and burst time. Draw a Gantt chart for preemptive priority- based CPU scheduling algorithm (dispatch delay o=1, the highest number means the highest priority, in case of the same priority, FCFSalgorithm will be used to break the tie.) find efficiency ( Process Arrival Burst ID Priority time time P1 3 P3 15 18 16 P5 10 10 P4 12 12 P2 3 15 10 Efficiency =
Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process Burst Time Priority (smaller number means higher priority) P1 2 2 P2 1 1 P3 8 4 P4 4 2 P5 5 3 The processes are assumed to arrive in the order P1, P2, P3, P4, P5, all at time 0. a) Draw four charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, non-preemptive priority, and RR (quantum = 1 millisecond). b) What is the turnaround time of each process for each of the algorithms? c) What is the waiting time of each process for each of the algorithms? d) Which of the algorithms results in the minimum average waiting time?
Suppose that we have the table below that includes four processes with their Arrival times and Burst times, and a Round Robin of time quantum 1 millisecond to be used for CPU scheduling. Answer the following questions: Process Arrival CPU-burst ID time time P1 0 1 P2 3 3 P3 2 4 P4 4 3 Completion Time Response Turn Around Time Time Waiting Time a. Draw the Gantt chart. b. Complete the above table. c. Calculate the average waiting time.
Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: Process Burst time P1 70 P2 40 P3 10 P4 40 4. P5 60 1) Draw Gantt charts illustrating the execution of these processes using FCFS, SJF, and RR (quantum-10) scheduling. 2) What is the waiting time of each process for each of the scheduling algorithms? 3) Which of the schedules results in the minimal average waiting time (over all processes)? 3.