Consider the following set of processes, with the length of the CPU burst time, Arrival Timeand Priority (5 the highest):TELLProcessCPU BurstArrivalPriority3P110P2625P3P4222431P5854Draw the Gant-chart and calculate the average turnaround time, if the followingalgorithm is used: a. FCFS, b. SRTF, c. Priority, d. RR with the quanta of time is 2.

Consider the following set of processes, with the length of the CPU burst time, Arrival Time and Priority (5 the highest): CPU Burst Arrival 10 6 Process Priority 3 P1 P2 2 5 P3 2 2 2 P4 4 3 1 P5 8 5 4 Draw the Gant-chart and calculate the average turnaround time, if the following algorithm is used: a. FCFS, b. SRTF, c. Priority, d. RR with the quanta of time is 2.

Consider the following set of processes, with the length of the CPU burst time, Arrival Time and Priority (5 the highest): CPU Burst Arrival 10 6 Process Priority 3 P1 P2 2 5 P3 2 2 2 P4 4 3 1 P5 8 5 4 Draw the Gant-chart and calculate the average turnaround time, if the following algorithm is used: a. FCFS, b. SRTF, c. Priority, d. RR with the quanta of time is 2.

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

Consider the following set of processes, with the length of the CPU burst and I/O burst given in milliseconds: Process CPU, I/O, CPU Arrival time P1 2, 3, 1 0 P2 2, 1, 4 4 P3 1, 1, 4 10 P4 6, 6, 6 13 For example: In FCFS a process p1 arrived at 0 ms gets CPU for 2 ms, then releases CPU to the next process for 3ms where it performs I/O burst and return back to the queue with a new arrival time as (2+3 = 5ms) 5 ms. In case of a tie, go with process number. Perform the following for FCFS and non-preemptive SJF scheduling algorithm: Calculate the average waiting time, average turnaround time. With respect to each metric justify which scheduling algorithm is good for the given process mix.
Consider the following set of processes, the length of the CPU burst time given in milliseconds: Process Burst time: P1 6 P2 8 P3 7 P4 3 Assuming the above process being scheduled with the SJF scheduling algorithm: The waiting time for process P1 is 3ms. The waiting time for process P1 is 0ms. The waiting time for process P1 is 16ms. The waiting time for process P1 is 9ms.
Consider four processes with the following start and end times: Process Start Time End Time ABCD 3 5 1 7 6 12 4 9 For each pair of proceses, say whether they run concurrently (Y) or not (N). (a) AB (b) AC (c) AD (d) BC (e) BD (f) CD
please answer b Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority P1 5 4 P2 3 1 P3 1 2 P4 7 2 P5 4 3 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. b.What is the turnaround time of each process for SJF and RR algorithms?
Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority P1 10 3 P2 1 1 P3 2 3 P4 1 4 Ps 5 2 The processes are assumed to have arrived in the order P1, P2, P3, P4, Ps,all at time 0. a. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, nonpreemptivepriority (a smaller priority number implies a higher priority), and RR (quantum= 1). b. What is the turnaround time of each process for each of the scheduling algorithms in part a? c. What is the waiting ti1r1e of each process for each of these schedulingalgorithms? d. Which of the algorithms results in the minimum average waiting time (over all processes)?
Consider the following processes, arrival times, and CPU burst times: Arrival CPU Burst Process Time Time P1 0 7 P2 2 4 P3 4 2 P4 10 1 For each of the following scheduling algorithms: (a) Shortest Job First (SJF) preemptive (b) Round Robin (RR): quantum : 3 Answer the following: Draw the Gantt chart and upload the picture in the space provided. What is the waiting time and turnaround time of each process? What is the average waiting time and turnaround time for the set of processes?
5-Consider a computer running a program that requires 400 s, with 80 s spent executing FP instructions, 40 s executed L/S instructions, and 40 s spent execut- ing branch instructions. • By how much is the total time reduced if the time for FP operations is reduced by 5%? • By how much is the time for INT operations reduced if the total time is reduced by 5%? • Can the total time can be reduced by 10% by reducing only the time for branch instructions?
Consider the following set of processes, with the length of the CPU burst given in milliseconds. Process P1 P2 Burst time 7 4 P3 5 The processes are assumed to have arrived in the order P1, P2, P3, all at time 0. a. Draw the Gantt chart and demonstrate the start and end time of each process that illustrates the execution of these processes using round robin scheduling (time quantum-4 milliseconds). b. Calculate the average waiting time and the average turnaround time of the three processes.
please do all the steps
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).
Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority P1 2 2 P2 1 1 P3 8 4 P4 4 2 P5 5 3 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, non-preemptive priority (a larger priority number implies a higher priority), and RR (quantum = 2). What is the turnaround time of each process for each of the scheduling algorithms in part a? What is the waiting time of each process for each of these scheduling algorithms? Which of the algorithms results in the minimum average waiting time (over all processes)?