7. Consider the following table: P1 P2 P3 P4 P5 P6 Process 17 4 8 1 12 5 Burst Time 5 2 3 1 3 4 Priority a). Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS SJF Non Preemptive Priority and Round-Robin (quantum=4). Which algorithm gives less average waiting time?

7. Consider the following table: P1 P2 P3 P4 P5 P6 Process 17 4 8 1 12 5 Burst Time 5 2 3 1 3 4 Priority a). Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS SJF Non Preemptive Priority and Round-Robin (quantum=4). Which algorithm gives less average waiting time?

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: Suppose there are two periodic/isochronous requests P1 and P2: P1: (35, 70) P1: (40, 95) Question…

A: Here below we solve all question:…

Q: Q24. Consider the set of 5 processes whose arrival time, burst time, and priority are given below:…

A: CPU scheduling is a process that allows one process to use the CPU while another process is delayed…

Q: What is the turnaround time of each process for each of the scheduling algorithms, FCFS, SJF (if two…

A: given, Process Priority Burst TimeP1 1 20P2 3…

Q: 3. solve by using (SJF,FCFS,"RR with Quantum(4)") (Solve it preemptive non preemptive scheduling)…

A: To solve using SJF, FCFS and Round robin

Q: A system is using 3-level priorities (levels 0, 1, and 2, where the smaller level the higher the…

A: As per company guidelines, only 3 sub parts will be answered. So, please repost the remaining…

Q: b. Thread Allocation ABCD 3 1 2 1 2 1 0 2 2 4 1 3 Max A B C D 5 4 6 3 3 1 2 2 2 5 3 3 6 4 1 2 5 6 7…

A: Given that, There are five tasks that are T0, T1, T2, T3 and T4 There are four resources that are A,…

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: Process Arrival Burst P1 00 7 P2 2 4 P3 4 2 P4 6 2 Draw two…

A: FCFS:- It stands for first come first serve, means execute the process which come first. Preemptive…

Q: If P6 is allocated, what is the BA? ||

A: Here is the solution:

Q: Suppose that an operating system supports two kinds of sequential processes: high-priority…

A: Introduction of Operating System: An operating system (OS) is a collection of software that manages…

Q: 5.5 The following processes are being scheduled using a preemptive, round- robin scheduling…

Q: Solve this table using the Multi-level queue scheduling (FCFS, RR, Priority) Time Quantum = 2…

A: To solve the table using the Multi-level queue scheduling with First-Come-First-Serve (FCFS), Round…

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

A: The waiting time of P2 in each of the scheduling algorithm as well as the average waiting time in…

Q: Consider the following set of processes (a smaller priority number implies a higher priority). The…

A: Lets understand the scheduling algorithms given: FCFS : First come First serve : The process which…

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

7. Consider the following table:
P1
P2
P3
P4
P5
P6
Process
17
4
8
1
12
5
Burst Time
5
2
3
1
3
4
Priority
a). Draw four Gantt charts that illustrate the execution of these processes using the following
scheduling algorithms:
FCFS
SJF Non Preemptive
Priority and Round-Robin (quantum-4).
Which algorithm gives less average waiting time?

Expert Solution

This question has been solved!

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

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1: Solving the given question using FCFS Scheduling Algorithm:

VIEW

Step 2: Solving the given question using SJF(Shortest Job First) Non-Preemptive Scheduling Algorithm:

VIEW

Step 3: Solving the given question using Priority Scheduling Algorithm:

VIEW

Solution

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 4 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

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 larger priority number implies a higher priority), and RR (quantum = 2). 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 scheduling algorithms? Which of the algorithms results in the minimum average waiting time (over all processes)?
Please solve it correctly.
Process Burst Time Priority P1 6 3 P2 1 P3 P4 4 P5 3 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time e. a. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, non- preemptive SJF, non-preemptive 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? c. What is the waiting time of each process for each of these scheduling algorithms? d. Which of the algorithms results in the minimum average waiting time (over all processes 2. 2. 5. 4)
SHORTEST-JOB-FIRST (SJR) SCHEDULING- SJF (non-preemptive) 3. Consider the process P1, P2, P3 and P4 are arrived at the same time with the following burst time in seconds. Draw the Gantt Chart and find the average waiting time using Non-preemptive SJF? Process Burst Time P1 4 P2 7 P3 2 P4 3
Consider the following processes with their arrival times and burst times: Process Arrival time Burst time P1 8 1 P2 5 1 P3 2 7 P4 4 3 P5 2 8 P6 4 2 P7 3 5 Draw two Gantt charts illustrating the execution of these processes using SJF-non-preemptive and SJF-preemptive scheduling algorithm. Draw Gantt Chart of RR with Time Quantum of 2. Calculate Average waiting time and which of the schedules above results in the minimal average waiting time (over all processes)?
Draw the Gantt Chart of the sequence of execution of the processes using Round RobinScheduling Algorithm considering the arrival time for all the process as ‘0’ and the quantum time as ‘3’. Find the average waiting time of the processes.