a) Draw Gantt charts for the execution scenarios assuming: - FCFS scheduling - Non-preemptive SJF scheduling - Non-preemptive priority scheduling - Pure Round-Robin scheduling with the quantum = 3 b) What is the waiting time of each process in each case? c) What is the response time of each process in each case? d) What is the turn-around time of each process in each case?

a) Draw Gantt charts for the execution scenarios assuming: - FCFS scheduling - Non-preemptive SJF scheduling - Non-preemptive priority scheduling - Pure Round-Robin scheduling with the quantum = 3 b) What is the waiting time of each process in each case? c) What is the response time of each process in each case? d) What is the turn-around time of each process in each case?

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

A job scheduler receives job requests with a priority of execution attached to it,in the following sequence. The higher the priority value, the higher the priority of job execution.Job ID: 464 212 110 840 976 343Priority: 3 2 3 1 2 2Build a treap for the jobs scheduled for execution. How would the treap look when the highest priority jobs have completed execution and therefore have quit the treap?
Following is the order in which task requests with a priority of execution are received by a job scheduler. The priority of task execution increases with a greater priority value.Work ID: 464 212 110 840 976 3433 2 3 1 2 2 priorityCreate a treasury for the upcoming tasks. How would the treap appear once the top priority jobs had finished running and left the treap?
Part IV: Scheduling. Suppose that processes P1, P2, ..., P4 arrive for execution at the times indicated in Table below. Each process will run for the amount of time listed, and will be assigned a priority ranging from 0 (highest) to 10 (lowest). No more processes will arrive until the last process completes. In answering the questions, base all decisions on the information you have at the time the decision must be made. Arrival Time Process Priority Burst Time 8 P1 P2 10 4 5 P3 5 P4 8 2 1 1) Draw two Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: a) Non-preemptive Priority b) Round Robin (Quantum time is 4) c) What is the waiting time for non-preemptive Priority scheduling algorithm?
Six batch jobs arrive almost at the same time in the following order: p1;p2; : : : ;p6. The table below contains their running times and priorities: Job p1 p2 p3 p4 p5 p6Running time (in min) 8 1 5 3 7 4Priority 3 2 5 1 4 6 The highest priority is 6. For each of the following scheduling algorithms, determine the order of execution of processes and mean process turnaround time:(a) priority scheduling;(b) rst-come, rst-served;(c) shortest job rst.Scheduling is non-preemptive.
A process may be blocked and located into the corresponding event queue due to waiting for an event of a specific type, however it recommends thata process be able to only in one event queue at a time as illustrated in the following figure. Give an example in which you can demonstrate how to allow a process to wait for more than one event at the same time. In that circumstance, by what meanstransform the queuing structure of the figure to supportnew feature? Provide the definition of the structures in C/C++ with example.
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 file as 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.…
Assignment Scheduling Given the following processes. Process Burst Time P1 17 P2 5 P3 12 Using Round Robin (RR) scheduling with time quantum q=4, What is the average turnaround time?
Schedule the following single-instance processes, all ready at time 0, using the earliest-deadline first (EDF) scheduler. Show the schedule from time 0 to 50. (c is the computation time, d is relative deadline). task 1: c = 3, d = 15; task 2: c = 14, d = 46; task 3: c = 2, d = 16. Suppose there is a new process 4 with d= 17. What is the maximum value of the computation time of process 4 in order for it to be EDF-schedulable together with the original 3 processes (that is, all processes meet their deadlines). Justify.
Assignment Scheduling Given the following processes. Process Burst Time P1 17 P2 5 P3 12 Using Round Robin (RR) scheduling with time quantum q=4, What is the average waiting time?
Assume a binary semaphore variable, S is initialized to 1. The semaphore operations flow which is wait (S) – critical section – signal (S) has been changed. The new flow is signal (S) – critical section – wait (S). What will happened in this situation? Select one: a.a deadlock will occur b.processes will starve to enter critical section c.several processes maybe executing in their critical section
Suppose there are five processes, their arrival time and running time are listed as follows. Adopt FCFS and SJF, respectively, give the schedule order and average waiting time. Give the schedule order of SJF. Compute the average waiting time of SJF. Process Arrival time Running time P1 P2 P3 P4 0 3 4 5 3 10 6 1
A deadlock occurs when a group of processes is stalled because one process is holding a resource and waiting for another process to obtain it. Consider the situation when two trains are approaching each other on the same track and there is only one track: once they are in front of each other, neither train can proceed. In operating systems, a similar scenario happens when two or more processes possess certain resources while waiting on resources owned by other processes (s). In the picture below, Process 1 is holding Resource 1 and waiting for Process 2 to acquire Resource 2, while Process 2 is waiting for Resource 1. Give an example of a realistic deadlock avoidance approach and describe the basic strategy behind it.