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 Burst Time 8 Process Priority Time P1 10 P2 P3 4 1 2 7 P4 8 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?

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 Burst Time 8 Process Priority Time P1 10 P2 P3 4 1 2 7 P4 8 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?

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

Question 4 Execute SRT for the following group of processes and complete the following table: Process A B C D E TArrival 0 2 4 6 8 Ts 2 3 5 1 4 TFinish Answer Answer Answer Answer Answer TR Answer Â Answer Â Answer Â Answer Â Answer Â 1. If the process arriving has the same remaining execution time as the process in the CPU, then the process that is using the CPU will have the highest priority.Â 2. If there is no process in the execution state and two or more processes have the shortest remaining time, then you will use the lowest PID criterion (using lexicographical order). Question 5 Execute HRRN for the following group of processes and complete the following table: Process A B C D TArrival 0 2 4 6 Ts 3 5 4 1 TFinish Answer Answer Answer Answer TR Answer Â Answer Answer Answer Â If two or more processes in the ready queue…
Task 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (8 marks)A system adopts a round-robin scheduling approach, where every process gets thesame amount of execution time. In a recorded timespan, the system has four processesP1, P2, P3 and P4, none of which perform any I/O. They are shown in the followingsequence diagram: 2.1 What is the dispatch time for the given system? (1)2.2 What execution time is given to each process? (1)2.3 What is the average time spent waiting by a process? Show all calculations. (2)
Suppose a system has 5 processes, P = {P1, P2, P3, P4, P5}, and 4 resources, R = {R1, R2, R3, R4}, where there are 2 instances of R1, 1 instance of R2, 3 instances of R3, and 3 instances of R4. The current state of the system is defined by the following requests and assignments: P1 is requesting an instance of R3 and has been assigned an instance of R2; P2 is requesting an instance of R1 and has been assigned an instance of R3; P3 is requesting an instance of R4 and has been assigned an instance of R1 and an instance of R3; P4 is requesting an instance of R3; P5 is requesting an instance of R2 and has been assigned an instance of R4. Is there deadlock in this system? (Explicitly state yes, there’s deadlock or no, there isn’t.) If applicable, draw a wait-for graph or resource-allocation graph, and use the appropriate graph to justify your answer. If you conclude there is no deadlock, your justification should contain a sequence of execution for the processes which shows that…
A system has three processes (P1,P2, P3) and three resources (R1,R2, R3). There is one instance of R1 and R2. There are three instances of R3. P1 holds an R1 and is requesting an R3. P2 holds an R3 and is requesting an R1. P3 holds two instances of R3 and an R2. Does a deadlock exist? Justify your answer.
Let the processes P1, P2, P3, and P4 be given. They arrive in the system at the same time in this order. The processes have the following service times (in time units): Process P1 P2 P3 P4 Service time (CPU burst) 53 17 68 24 For the scheduling method "Shortest Job First" (SJF), specify the execution order of the processes, the average execution time (average turnaround time) and the average waiting time over all processes. You must show your calculations. You will not have to draw Gantt charts.
Consider 4 processes P0, P1, P2 and P3 that need to share 3 resource types A (10 instances), B(6 instances) and C (7 instances). The allocation of resources and the maximum need for 4processes as mentioned in the table.
Suppose that the following processes arrive for execution at the time given below. Each process will run for the amount of time listed. Calculate average turnaround and average waiting time for these processes under Shortest remaining time first (SRTF)(preemptive) scheduling AlgorithmHints: turnaround time: The interval from the time of arrival of a process to the time of completionWaiting time: The sum of the periods spent waiting by a process in the ready queue
Suppose that the following processes arrive for execution at the times indicated. Each process will run for the amount of time listed. In answering the questions, use nonpreemptive scheduling, and base all decisions on the information you have at the time the decision must be made. Process Arrival Time Burst Time Pl 0.0 8 P2 0.4 4 P3 1.0 1 a. What is the average turnaround time for these processes with the FCFS scheduling algorithm?b. What is the average turnaround time for these processes with the SJF scheduling algorithm? c. The SJF algorithm is supposed to improve performance, but notice that we chose to run process P1 at time 0 because we did not k11ow that two shorter processes would arrive soon. Compute what the average turnaround time will be if the CPU is left idle for the first 1 unit and then SJF scheduling is used. Remember that processes P1 and P2 are waiting during this idle time, so their waiting time may increase. This algorithm could be known as future-knowledge…
Let the processes P1, P2, P3, and P4 be given. They arrive in the system at the same time in this order. The processes have the following service times (in time units): Process P1 P2 P3 P4 Service time (CPU burst) 53 17 68 24 For the scheduling method "Round Robin" (RR), specify the average execution time (average turnaround time) and the number of context switches. The time quantum q is set to 20 time units. You must show your calculations. You will not have to draw Gantt charts. Note: For RR, processes execute in order of their ID (i.e., P1-P2-P3-P4).
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.…
To not let any process wait longer than 500 ms, a system developer programs the Round Robin procedure with a dynamic time quantum size. With ‘n’ processes ready, the time quantum Q is set to 500 ms/n. What do you think of this scheduling strategy? (In which situations is this strategy feasible, and when is it not? Are there edge cases?) Explain your reasoning.
A real-time system executing four different periodic tasks Ti(p,t) is given, with p and t representing the period and the execution time of the task, respectively. Each task's deadline matches its period p. The system is executing the following set of tasks: S = {T1(10,2), T2(4,1), T3(10,3), T4(7,1)}. Is this real-time system schedulable under Rate-Monotonic (RM) scheduling? Is this real-time system schedulable under Earliest Deadline First (EDF) scheduling? Explain your answers using the concept of overall CPU utilization.