For the set of processes below (" 1- Schedule them using SRTF ( 2- Calculate the average waiting time ( 3- Calculate the average response time 4- Calculate the CPU utilization ( 5- Calculate th throughput To be eligible for any grades, you have to show your work in details including the equations you have used and the calculations you have made. Process Arrival ID Time Burst Deadline Priority P1 2 25 4 15 P2 4 16 3 10 P3 8. 12 2 4 P4 18 1 20 1

For the set of processes below (" 1- Schedule them using SRTF ( 2- Calculate the average waiting time ( 3- Calculate the average response time 4- Calculate the CPU utilization ( 5- Calculate th throughput To be eligible for any grades, you have to show your work in details including the equations you have used and the calculations you have made. Process Arrival ID Time Burst Deadline Priority P1 2 25 4 15 P2 4 16 3 10 P3 8. 12 2 4 P4 18 1 20 1

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

With the table below, draw the Gantt chart and solve the scheduling criteria. Process Burst time (BT) PL Arrival Time (AT) A 8 8 5 B 4 4 0 C 3 5 3 D 6 3 12 E 4 10 8 HPL = 10
Assume that the operation times of one add instruction for the major functional units are 325 ps for memory access, 185 ps for ALU operations and 125 ps for register file read/writes. Please fill the table first and perform the following a )What is the total cycle in single-cycle implementation? b )What is the total cycle in pipelining implementation? c) What is the total cycle in pipelining implementation if there are 5 million add instructions? d) What is the total cycle in pipelining implementation for 5 million add instructions, if the stages are balanced? e)What is the speed up of pipelining implementation over single-cycle implementation?
15
(Q1, The process is an execution of program, which represented in the OS by process control block. Keep this in your mind to analyze the process control block and show how it works and interact with each other, with appropriate diagram.
You are designing a real-time system that must execute the following set of processes: P1(20,3); P2(5,2); P3(350,15); P4(500,22); P5(100,10) Note: The first parameter listed for each process is the period, and the second is the maximum execution time. Can these processes be scheduled using Rate Monotonic? You must justify your answer. Can these processes be scheduled using Earliest Deadline First? You must justify your answer. If possible, identify the simplest of these strategies that can be used to schedule these processes.
Explain the impact of "changing time quantum" on process execution by defining the term Time Quantum in Round-Robin scheduling.
Using the priority list T3, T4, T6, T5, T7, T10, T2, T1, T9, T3, schedule the project below with two processors. T1 (4) T5 (7) Т9 (12) T2 (3) Т6 (6) T8 (5) T10 (8) End Т3 (9) T7 (11) T4 (10) Task 5 is done by Select an answer v starting at time Task 6 is done by Select an answer v starting at time
1.How do we call a situation when process is executed at a different site than the one which initiated it: A) process delegation B) process migration C) resource sharing D) resource allocation 2.What is NOT a valid the reason for a process migration: A) hardware preference B) software preference C) load balancing D) privilege escalation 3.Which scheme is commonly used for large-scale parallel computations : A) GFS B) MapReduce C) NFS D) OpenAFS 4.What can be used to ensure reasonable performance of a remote-service mechanism: A) direct memory access B) shared memory C) caching D) shared data
1. Schedule the following programs with listed workload and burst time and calculate average wait time for each algorithm: use (1) shortest job first, (2) first come first served (processes arrive in order P1 up to P5), (3) first come first served (processes arrive in reverse order P5 down t P1), and (4) Round Robin (assume 4 units of time every round) Process Burst time P1 7 P2 13 P3 8 P4 9 P5 15
assume a system has 6 identical resources and N processes competing for them. each process can request at most 2 resources. what is the maximum value of N for the system to be deadlock free?
Using the priority list T3, T1, T6, T2, T5, T4, T7, schedule the project below with two processors. TI (3) T4 (11) T6 (5) End T2 (8) T5 (7) 17 (12) T3 (4) Task 5 is done by Select an answer starting at time Task 7 is done by Select an answer e starting at time
Derive the states of the three processes P1, P2 and P3 from below resource allocation diagram and explain why. (A solid line indicates that the resource has been allocated to the process; a dashed line means that the process is waiting for the resource) P1 Processor P2 1/0 P3 Main memory