The arrival time of the process PI, P2, and P3 and their CPU-Burst time (unit time) are shown inthe following table. Answer the following questions:CPU-Burst TimeProcessArrival TimePI20P2P33.When using FIFO scheduling algorithm,(1) The turmaround time of Pl is:(a) 20(b)23(c)24(d)22.3(2) The turnaround time of P2 is:(b)(3) The turnaround time of P3 is:(b)(4) The average turnaround time is:(b) 23(a) 2023(c)24(d)22.3(a)2023(c)24(d)22.3(a) 20(c)24(d)22.3When using SJF scheduling algorithm,(5) The turnaround time of PI is:20(a)(b)22(c)26(d)22.3(6) The turnaround time of P2 is:(a) 20(7) The turmaround time of P3 is:(b)22(c)26(d)22.3(b)(8) The average turnaround time is:(b)(a)2022(c)26(d)22.3(a) 2022(c)26(d)22.3When using SRF scheduling algorithm,The turnaround time of P1 is:(b) 5(10) The turnaround time of P2 is:(b) 5(11) The turnaround time of P3 is:(b) 5(12) The average turnaround time is:(b) 5(9)(a) 4(c)12(d)27(a) 4(c)12(d) 27(a) 4(c)12(d)27(a)4(c)12(d)27

As per the guidelines answered whole 1st question FIFO scheduling algorithm.

The arrival time of the process PI, P2, and P3 and their CPU-Burst time (unit time) are shown in the following table. Answer the following questions: Proces CPU-Burst Time Arrival Time PI 20 P2 P3 When using FIFO scheduling algorithm, (1) The turmaround time of PI is: (b) (2) The turnaround time of P2 is: (b) (3) The turnaround time of P3 is: (b) 23 (4) The average tumaround time is: 23 (a) 20 23 (e) 24 (d) 22.3 (a) 20 23 (e) 24 (d) 22.3 (a) 20 (e) 24 (d) 22.3 (a) 20 (b) (e) 24 (d) 22.3

The arrival time of the process PI, P2, and P3 and their CPU-Burst time (unit time) are shown in the following table. Answer the following questions: Proces CPU-Burst Time Arrival Time PI 20 P2 P3 When using FIFO scheduling algorithm, (1) The turmaround time of PI is: (b) (2) The turnaround time of P2 is: (b) (3) The turnaround time of P3 is: (b) 23 (4) The average tumaround time is: 23 (a) 20 23 (e) 24 (d) 22.3 (a) 20 23 (e) 24 (d) 22.3 (a) 20 (e) 24 (d) 22.3 (a) 20 (b) (e) 24 (d) 22.3

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

We have two jobs X and Y. The combination of them is called job Z. Thus Z= (Note the order in the sequence.) Job X is 3s CPU followed by 3s I/O. Y is 3s I/O followed by 3s CPU. (A). Serial Execution. (A1) What is the turnaround time of Z? Tr(Z) = [Select] (A2) What is the cpu utilization? CPU(Z) = [Select] (B). Batch Multiprogramming. (B1) What is the turnaround time of Z? Tr(Z) = [Select] (B2) What is the CPU utilization ? CPU(Z) = [Select] (C) Time sharing with timeslice 1s. (C1) What is the turnaround time of Z? Tr(Z) = [Select] (C2) What is the CPU utilization ? CPU(Z)=[Select]
Given in Table 1 is a set of five (5) processes with the priority, length of the CPU-burst time, and arrival time. Table 1 Process Arrival Time (ms) Burst Time (ms) Priority* P1 3 P2 1 2 1 P3 3 P4 7 P5 8 8 4. *Note: • A smaller priority number implies a higher priority. a) Compute the Waiting Time (WT) of each process in Table 1, and also compute their Average Waiting Time, for each of the following scheduling algorithms. i. Shortest Job First (SJF). ii. Pre-emptive Priority (PP) iii. Round Robin (RR) with quantum = 3 (ms).
We have 4 periodical processes II₁, I₂, I3 and П4, that process a video. We know their periods P, and their running times C; (in milliseconds). For: (a) the rate monotonic scheduling (RMS) algorithm and (b) the earliest deadline first (EDF) algorithm draw diagrams that displays the schedule for those processes for a period of 150 ms. The times are the following: Process PC₁ II₁ 45 10 II₂ 40 10 II 3 35 5 II4 50 10 In the case of equal priorities the process that is already running has the priority. If this is not the case then take the process with the lowest ID. Does any of the above algorithms fail?
A scientific computation parallel program consists of 23040 tasks. The minimum time taken for processing each task is 1 min. This time cannot be optimized further by software. There is no dependency between each of these tasks and they are 100% parallelizable This program takes 24 hours (1 day) to complete on a 16 core Multicore Processor system. This Multicore processor does not support hardware multithreading. What can be done to reduce the execution time of the program to 1 hour. Assume that we are allowed to add, modify and make any changes required to the hardware system and software to make this happen. We are also allowed to add more systems. Also assume Were is no communication overhead at all within the processor, motherboard or network 1/O. Please explain your answer
A single-CPU system has four processes, P1, P2, P3 and P4 in the ready queue. The execution times and I/O needs for these processes are given below. All times are in ms. (hint: when a process starts an IO operation, it is removed from the ready queue and put back at the end of the queue only when it completes its IO). Process P1: Arrives at 0ms, needs 23ms of CPU time. Performs I/O for 5ms after 10ms of its execution time, then another 5ms after 20ms of its execution time. Process P2: Arrives at 3ms, needs 12ms of CPU time. Performs I/O for 10ms after 5ms of its execution time. Process P3: Arrives at 1ms, needs 15ms of CPU time. Performs I/O for 1ms after 7ms of its execution time. Process P4: Arrives at 2ms, needs 8ms of CPU time. Performs I/O for 5ms after 4ms of its execution time. We assume that the CPU is idle if no one of these four processes is using it. Using Round Robin scheduling algorithm with a Time Quantum of 4ms and ignoring the context switch time, determine: a) 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?
Consider the FIVE (5)process with their CPU burst time and arrival time. Process Arrival Time CPU burst time P0 0 1 P1 2 3 P2 1 4 P3 1 3 P4 3 2 Based on the above data, answer the following Draw a time line for the following algorithm: Shortest Job First (SJF) Shortest Remaining Time (SRT)
3. Apply Round Robin Scheduling algorithm to find out the Average Waiting Time, Average Turnaround time using the information given below. Time slice 24 msecs. Process CPU burst time (msec) 106 122 66 98
Computer Science In theory, it is possible to have some CPU cores execute one scheduling algorithm (e.g. round-robin) on one set of processes, and some other CPU cores execute another scheduling algorithm (e.g. FCFS) on another set of processes. High-level code for such a scheduler might look like: What do you see as the advantages and disadvantages of using this scheme instead of a single scheduling algorithm?
Suppose that we have the table below that includes four processes with their Arrival times and Burst times, and a Round Robin of time quantum 1 millisecond to be used for CPU scheduling. Answer the following questions: Process Arrival CPU-burst ID time time P1 0 1 P2 3 3 P3 2 4 P4 4 3 Completion Time Response Turn Around Time Time Waiting Time a. Draw the Gantt chart. b. Complete the above table. c. Calculate the average waiting time.
Because every computation includes a sequential portion, there is a limit to how much you can speed up a task by adding processors. 3. Suppose a task includes one minute of sequential steps and a parallelizable portion that would take an hour if done sequentially. Fill in this table: Number of Processors C. 1 2 3 4 10 20 30 60 120 240 480 Total Time Required 61 minutes (1 hr + 1 min) 31 minutes (30 min + 1 min) Solution Type sequential solution parallel solutions 4. Consider the law of diminishing returns: a. If you have one processor and you add one more, how much time do you save? b. If you have 240 processors and you add 240 more, how much time do you save? Talk with Your Partner How many processors do you think are worth having for this problem?
Consider the following processes arriving at the ready queue and dispatched to a single core CPU using preemptive shortest job first scheduling: PID Arrival Time Burst (ms) 10 0 11 11 3 12 5 13 13 14 16 15 21 63926 Answer the following: (a) Draw a Gantt chart showing the arrival time and run times for each process. (b) Calculate the wait time for each process and average waiting time. (c) Calculate the turnaround time for each process.