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?

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?

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 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)
Calculate the CPU execution time (expressed in milliseconds) of a program with 10 million instructions on a 2.5 GHz CPU with the following basic instruction-type breakdowns and CPIs: Arithmetic: 60%, CPI = 2 Load & Store (assuming perfect caches): 25%, CPI = 5 Branching: 15%, CPI = 3 In addition, you are told that the overall cache miss rate for instructions is 1%, the overall cache miss rate for data is 3%, and the cache miss penalty is 100 cycles. You can ignore the hit time (consider it zero).
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 The processes are assumed to have arrived in the order of P1, P2, P3, P4, P5 all at time 0. a. Draw the Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: preemptive priority (a larger priority number implies a higher priority), and RR (quantum = 2). b. What is the turnaround time of each process for each of the scheduling algorithms in part i? c. Which of the algorithms results in the minimum average waiting time (over all processes)?
Consider the following set of processes, the length of the CPU burst time given in milliseconds: Process Burst Time P1 6 P2 8 P2 7 P4 3 Assuming the above processes are being scheduled with the Shortest Job First (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 From the following list which is the deadlock avoidance algorithm? Banker’s algorithm Round-robin algorithm Elevator algorithm Karn’s algorithm A problem encountered in multitasking when a process is perpetually denied necessary resources is called Deadlock Starvation Inversion Aging To break a deadlock: Abort one or more processes to break the circular wait Abort all the process in the system Preempt all resources from all processes None of the mentioned Termination of the process terminates First thread of the process First two threads…
Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process Burst Time Priority (smaller number means higher priority) P1 2 2 P2 1 1 P3 8 4 P4 4 2 P5 5 3 The processes are assumed to arrive in the order P1, P2, P3, P4, P5, all at time 0. a) Draw four charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, non-preemptive priority, and RR (quantum = 1 millisecond). b) What is the turnaround time of each process for each of the algorithms? c) What is the waiting time of each process for each of the algorithms? d) Which of the algorithms results in the minimum average waiting time?
Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority Arrival Time P1 20 2 0 P2 10 1 1 P3 80 4 2 P4 40 2 3 P5 50 3 4 Draw the GANTT Chart for the schedule of the processes, the waiting time for each process, the average waiting time, the turnaround time for each process and average turnaround time using the following scheduling algorithm.…
Consider a group of 5 benchmarks. With an old generation of CPU in the 90s, the execution times of these benchmarks were 10 minutes, 16 minutes, 4 minutes, 1 minute and 8 minutes. With a new generation of CPU in 2020, the execution time of these benchmarks are 5 minutes, 2 minutes, 2 minutes, 15 seconds and 1 minutes. What is the average speedup of the new CPU (comparing to the old CPU)? Note that, you need to determine whether arithmetic mean or geometric mean should be used here.
do { flag[i] = true; turn = i; while (flag[j] && turn == j); Critical section flag[i] = FALSE; Remainder section } Three processes P1, P2, and P3 are sharing a resource R1 in a mutually exclusive manner. Using compare_and_swap instruction, show code for P1, P2, and P3 that shows the entry section and exit section (similar to the code shown in Question 1). Using this code, show a scenario if all three processes want to enter their critical sections.
Consider the following set of processes, with the length of the CPU burst given in milliseconds Process Burst Time Priority P1 5 1 P2 2 3 P3 1 3 P4 1 2 P5 10 4 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, and RR (quantum = 3). 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 the scheduling algorithms in part a? Which of the algorithms results in the minimum average waiting time (over all processes)?
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).
1. Consider the following set of processes, with the length of the CPU burst given inmilliseconds: Process Burst Time PriorityP1 2 2P2 1 1P3 8 4P4 4 2P5 5 3 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.a. Draw four Gantt charts that illustrate the execution of these processes using thefollowing scheduling algorithms: FCFS, SJF, nonpreemptive priority (a larger prioritynumber implies a higher priority), and RR (quantum = 2).b. What is the turnaround time of each process for each of the scheduling algorithms inpart a?c. What is the waiting time of each process for each of these scheduling algorithms?d. Which of the algorithms results in the minimum average waiting time (over allprocesses)?
Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority Arrival Time P1 20 2 0 P2 10 1 1 P3 80 4 2 P4 40 2 3 P5 50 3 4 Draw the GANTT Chart for the schedule of the processes, the waiting time for each process, the average waiting time, the turnaround time for each process and average turnaround time using the following scheduling algorithm. c.…