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

Similar questions

Q1. Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: Process P1 P2 P3 P4 Ps Burst Time Priority 10 1 1 3 1 4 2 a. Draw four Gantt charts illustrating the execution of these processes using FCFS, SJF, a non-preemptive priority (a smaller priority number implies a higher priority), and RR (quantum= 1) scheduling. 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 the scheduling algorithms in part а? d. Which of the schedules in part a result in the minimal average waiting time (over all processes)?
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)?
Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: Process Arrival Time Burst time TTT P1 7 P2 2 4 P3 4 1 P4 4 4 P5 5 6 1) Draw Gantt charts illustrating the execution of these processes using FCFS, SJF, and RR (quantum = 1) scheduling. 2) What is the turnaround time of each process for each of the scheduling algorithms? 3) What is the waiting time of each process for each of the scheduling algorithms? 4) Which of the schedules results in the minimal average waiting time (over all processes)? 3.
Suppose there are four processes (P1 - P4) with respective arrival times of 0, 10, 30, and 40, and burst times of 30, 20, 50, and 20 ms. These processes are scheduled from a ready queue on first come first served. The average waiting time is?
Let the processes P1, P2, P3, P4, and P5 be given. They arrive in the system at the same time in this order. The processes have the attached service times (in time units) and priorities. For each of the scheduling methods (First Come, first served (FIFO), Shortest Job First, Round Robin, and Priority Scheduling), specify the execution order of the processes and the average execution time (average turnaround time) for all processes. First, determine and state the execution times of the individual processes and then calculate the average value. Note: • For Shortest Job First, If the required service time (CPU time) is the same for two or more processes, use First Come, first served to resolve the conflict. • For Round Robin, the time quantum q = one time unit. • For Priority Scheduling, low integer priority values signify high priorities, with O being the highest possible priority. If multiple processes have the same priority, use First Come, first served to resolve the conflict. Also,…
Suppose that the following processes arrive for execution at the times indicated. Each process has the shown priorities and will run for the amount of time listed (all times are in ms) Process Arrival Time Burst Time Priority Queue P1 15 3 P2 20 3 P3 20 20 P4 25 10 2 P5 30 5 2 P6 35 15 1 To schedule the execution of these process, a preemptive multi-level queue scheduler is designed to apply the following policy at each decision instant (namely whenever a new process arrives and whenever a burst completes execution): • Serve the process at the highest priority queue first • If two processes are in the same queue: . If they have different remaining time, follow the SRTF policy o If they have same remining time, follow a RR policy (slice time = 2 ms) Given the above: 1. Show the scheduling order of the bursts using a Gantt chart.
Consider the following set of four processes. Their arrival time and time to require completing the execution are given in the following table. Consider all times in milliseconds. Implement the SJF algorithm on given chart. Process Arrival Time (T0) Time required for completion (CPU Burst Time) P0 0 10 P1 1 6 P2 3 2 P3 5 4
Consider the following set of processes (a smaller priority number implies a higher priority). The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0. Process Priority Burst Time P1 1 20 P2 3 25 P3 4 25 P4 2 15 P5 5 30 What is the waiting time of each process for each of the scheduling algorithms FCFS, SJF (if two jobs have the same burst time, schedule them following priority), non-preemptive priority? Process FCFS SJF Priority P1 P2 P3 P4 P5
Consider the following set of 5 processes, with the length of the CPU-burst time given in milliseconds arriving at time 0: P1, P2, P3, P4, and P5 with corresponding burst time: 20, 47, 13, 17 and 22. The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. a. Calculate average waiting time for First Come First Serve and None Preemptive Shortest Job First CPU scheduling algorithms. b. Which of the schedules in part a results in the minimal average waiting time (over all processes)?
Four processes arrive at the same time with their priorities, execution times and I/0 times given in the table below. Assuming a Round-Robin Scheduling works with a quantum time of 3, but the scheduler selects the with highest priority from the queue (NOT those arrived earliest), other than currently pre-empted process, at each turn3; process a-)Draw the timeline for CPU- and I/O- bursts for these processes b-)Calculate average turn-around time Exec 1/0 Exec /0 Process Priority 2. P1 10 4 P2 7. 4. 4 P3 1 10 1 4 Pa