Q6 )The following processes are submitted to an operating system. They are calculation processeswhich require no input/output (i.e. they are always ready to utilize the CPU)1. Draw Gantt charts that illustrate the execution of these processes using the following schedulingalgorithms: FCFS, Preemptive and non preemptive SJF, preemptive and nonpreemptivepriority, Highest response ratio next (HRRN), and RR (quantum = 2).2.What is the average turnaround time average waiting time, schedule length, and throughputof each process for each of the scheduling algorithms in part 1?3. Which of the algorithms results in the minimum average waiting time (over all processes)? (1. FCFSPID AT BT0P18P26P3P4P5PlP2P32. Non-Preemptive SJFPID AT BT CT TAT082211933Gantt Chart:61P419P5 3 3Gantt Chart:.2.23. Preemptive SJFPIDPLP2P31P41 9PS 3 3Gantt Chart:BT0 8126AT2CT TAT WTCTΤΑΊWTWTAverage Turnaround Time-Average Waiting time =Schedule Length-Throughtput-.Average Turnaround Time=Average Waiting timeSchedule Length=ThroughputAverage Turnaround Time. Average Waiting time-Schedule Length=Throughtpat

1.FCFS NON-PREEMTIVE: Which means that if the process get started for execution it never ended until…

Q6 )The following processes are submitted to an operating system. They are calculation processes which require no input/output (i.e. they are always ready to utilize the CPU) 1. Draw Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, Preemptive and non preemptive SJF, preemptive and nonpreemptive priority, Highest response ratio next (HRRN), and RR (quantum-2). 2. What is the average turnaround time average waiting time, schedule length, and throughput of each process for each of the scheduling algorithms in part 17 3. Which of the algorithms results in the minimum average waiting time (over all processes)? ( 1. FCFS PID AT BT PI 0 S P2 2 . P3 P4 P5 . 2 P3 2 P4 1 PS 3 2 1 3 Gantt Chart: 2. Non-Preemptive SJF PID AT BT CT TAT WT 0 S Pl P2 6 HERREX PID AT PI 0 3 Gantt Chart: . P2 2 61 3. Preemptive SJF P3 2 P4 1 PS 3 9 6 1 BT 8 6 1 9 3 9 3 Gantt Chart: CT TAT WT CT TAT WT . . Average Turnaround Time- Average Waiting time => Schedule Length- Throughtput- Average Turnaround Time= Average Waiting time - Schedule Length= Throughput Average Turnaround Time Average Waiting time- Schedule Length Throughtpat-

Q6 )The following processes are submitted to an operating system. They are calculation processes which require no input/output (i.e. they are always ready to utilize the CPU) 1. Draw Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, Preemptive and non preemptive SJF, preemptive and nonpreemptive priority, Highest response ratio next (HRRN), and RR (quantum-2). 2. What is the average turnaround time average waiting time, schedule length, and throughput of each process for each of the scheduling algorithms in part 17 3. Which of the algorithms results in the minimum average waiting time (over all processes)? ( 1. FCFS PID AT BT PI 0 S P2 2 . P3 P4 P5 . 2 P3 2 P4 1 PS 3 2 1 3 Gantt Chart: 2. Non-Preemptive SJF PID AT BT CT TAT WT 0 S Pl P2 6 HERREX PID AT PI 0 3 Gantt Chart: . P2 2 61 3. Preemptive SJF P3 2 P4 1 PS 3 9 6 1 BT 8 6 1 9 3 9 3 Gantt Chart: CT TAT WT CT TAT WT . . Average Turnaround Time- Average Waiting time => Schedule Length- Throughtput- Average Turnaround Time= Average Waiting time - Schedule Length= Throughput Average Turnaround Time Average Waiting time- Schedule Length Throughtpat-

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

Consider a computer environment in which there are 4 magnetic drives, 2 printers, 3 scanners, and 1 optical drive. Three processes P1, P2, P3 are using these resources. At any point in time, the allocations and requests for these resources are as follows. Allocations: Magnetic drive Printer Scanner Optical drive P1 1 P2 2 1 P3 1 Requests: Magnetic drive 2 Printer Scanner Optical drive P1 1 P2 1 1 P3 2 1 Is there any way that the processes can complete without deadlock? If yes, explain how. If not, explain why not.
Transcribed Image Text Consider the following set of processes, with arrival times and the length of the CPU burst time given in milliseconds. a. Draw a Gantt chart that illustrates the execution of these processes using the Shortest-Remaining Time First (SRTF) scheduling algorithm. b. Give the average waiting time of Shortest-Remaining Time First (SRTF) scheduling algorithm. Note: Preempted processes are added to the end of the ready queue. Process Arrival Time Burst Time A 4 B 1 3 1 D 3 4 3
A program is profiled on a CPU: 20% of all instructions are arithmetic, 40% are load, 20% are store, 20% are conditional branches. On this CPU, loads take 4 cycles, stores 1 cycle, ALU instructions 2 cycle, and branches 3 cycles. Compute the CPI for each instruction and the average CPI for that program on that CPU: Compute the CPI for each instruction (GIVE ANSWERS WITH 2 DECIMAL DIGITS: CPI for loads is CPI for stores is CPI for ALU is CPI for branches is Average CPI is
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…
Problem 4 There are two approaches for scheduling tasks on multiprocessor platform: the partitioned approach and the global approach. The table below shows Ci (WCET) and Ti (period) for six periodic tasks to be scheduled on m = 3 processors. The relative deadline of each periodic task is equal to its period. T T1 10 T2 10 25 T3 12 30 T4 10 T5 8. 20 T6 7 100 The task set is schedulable using rate-monotonic partitioned scheduling algorithm. Show how the task set is partitioned on m = 3 processors so that all the deadlines are met?
10. 10. Amdahl's Law is as applicable to software as it is to hardware. An oft-cited programming truism states that a program spends 90% of its time executing 10% of its code. Thus, tuning a small amount of program code can often have an enormous effect on the overall performance of a software product. Determine the overall system speedup if: 1. a) 90% of a program is made to run 10 times as fast (900% faster). 2. b) 80% of a program is made to run 20% faster.
COURSE Operating System Only correct answer will be upvoted. Else downvoted.
1. Explain the Round-Robin Scheduling algorithm with examples.
THIS IS A REAL-TIME SYSTEMS CLASS, PLEASE DON'T COPY AND PAST OTHER ANSWERS PLEASE!!