**Problem Statement:**Four processes—\( P_1, P_2, P_3, \) and \( P_4 \)—are scheduled to use a single processor. The table below shows the arrival time and duration of each of the four processes.| Process | Arrival Time (seconds) | Duration (seconds) ||---------|------------------------|--------------------|| \( P_1 \) | 0 | 7 || \( P_2 \) | 2 | 4 || \( P_3 \) | 4 | 1 || \( P_4 \) | 5 | 4 |**Question:**If the system uses a preemptive shortest-job-first scheduling algorithm, what is the average waiting time for the four processes, in seconds?

Here in this question we have given four processes with thier arrival time and duration and we have…

Answered: 13. Four processes-R, P,, P, and P,-are…

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

Real-time Scheduling: Choose all true assertions. Rate Monotonic (RM) scheduling divides time into equal parts and requires each process to seek a portion upon starting. RM schedules real-time systems with CPU utilization below 1. When CPU utilization is less than 1, Earliest Deadline First (EDF) may schedule a real-time system. A process is initiated every p time unit. RM scheduling prioritizes shorter processes. EDF scheduling prioritizes processes with the shortest time frame.
For Question, put your answer in the following blanks. Note: You must put answer only, no need to put the unit. One answer per blank.
Process PI P2 P3 P4 P5 Buast time 2 1 8 4 5 Priority (2*xx) %5 (2xxx) 5 (2*XX) 0/0 5 (2*XX) do 5 (2*xx) do 5 ✓ 11 Value of XX is 5 All processes Arrives at time + = 0 ms. Draw the Gantt chart for priority scheduling (A larger priority number implies higher priority)
Part I Assume that the ready queue has just received for processes: P1, P2, P3, P4, in that order. All at time 0. The CPU execution times for these processes are as follows: Process Execution Time P1 P2 P3 P4 13 8 15 6 Draw the Gantt chart and calculate the metric listed in parentheses for each of the following scheduling algorithms: 1. First Come, First Served (Total Wait Time) 2. Shortest Job First (Total Wait Time) 3. Round Robin, with a time quantum of 5 ms (Total Wait and Response Times) Part II Now assume that P1 arrives in the ready queue at time 0, P2 arrives at time 4, P3 arrives at time 10, and P4 arrives at time 20. The CPU execution times for the processes are the same as in Part I: Process Execution Time P1 P2 P3 P4 P1 13 P2 8 P3 15 P4 6 Draw the Gantt chart and calculate the total wait time for each of the following scheduling algorithms: 1. Shortest Job First 2. Shortest Remaining Time Next (remember, this is a preemptive algorithm) 3. Preemptive priority with the…
Q)Two processes P1, and P2 arrive at time=0 in order and have Process(execution time) as follows. P1(4), P2(2). Find the average waiting time for these processes if they are scheduled as Round Robin with time quanta of 1 unit. a)2 b)1 c)3 d)4 Q)Three processes P1, P2 and P3 arrive at time=0 in order and have Process(execution time) as follows. P1(10), P2(4), P3(7). Find the average response time for these processes if they are scheduled as Shortest Job First. a)12 b)3.3 c)5 d)4 Q)A process has executed 3 ms in its last burst and our estimate of its last burst was 6 ms. Find our estimate for its next burst with a)4 ms b)4.5 ms c)3.5 ms d)5 ms
Consider the following processes:Process Arrival Time Service Time A 0 3 B 1 1 C 3 3 D 4 2 E 5 5 Show how the above processes execute over time on a single CPU system (i.e., please drawthe schedule where the x-axis is the time). Compute the completion time for each process,and the average turnaround time for all processes under each of the following schedulers:(a) FCFS. (b) Round Robin with (q = 1). (c) Shortest Job First. (d) Shortest Remaining Time First. (e) HRRN.
Process F G H J K Arrival Time 2 3 11 17 24 Bust Time 4 9. 3 7 6. 12 Process P1 P2 P3 P4 Р5 P6 P7 Arrival Time 1 2 6. 7 4 Bust Time 1 3 4 1 2 1. Apply the following scheduling algorithms to the list of processes above. First-Come First-Serve Shortest Job First 2. For each process scheduling algorithm, provide the following: а. A complete and detailed table that contains the following criteria for each process Finish time Turnaround time Waiting time A detailed Gantt Chart The average turnaround time d. The average waiting time 3. Then, answer the following items b. c. Among the three (2) process scheduling algorithms that you have performed, which do you think is the most efficient and why? b. Cite significant differences in the results of applying the First-Come First-Serve algorithm and Shortest Job Firts algorithm. Elaborate on your answer. c. In your opinion, why does the average turnaround time and waiting time vary per algorithm? а.

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS