Assume there are three processes A, B and C. All processes are submitted for execution at the same time. The process A executes for 2 milliseconds and then does I/O for 3 milliseconds and then executes for 3 milliseconds more. The process B executes for 4 milliseconds and then does I/O for 7 milliseconds. The process C executes for 2 millisecond and then does 1/0 for 4 milliseconds. Assume no contention for the resources and the order of execution (priority) is A, B and C. a) Calculate the processor utilization without multiprogramming. b) Calculate the processor utilization with multiprogramming. c) Assume that the computer system has 512 Mbytes of available memory. What is the memory utilization with multiprogramming if Process A requires 256 Mbytes, Process B requires 128 Mbytes and Process C requires 64 Mbytes of memory. Note that: all processes are submitted for execution at the same time. d) What would be the total job duration, if these processes were executed on a multi-processor system with two processors?

Assume there are three processes A, B and C. All processes are submitted for execution at the same time. The process A executes for 2 milliseconds and then does I/O for 3 milliseconds and then executes for 3 milliseconds more. The process B executes for 4 milliseconds and then does I/O for 7 milliseconds. The process C executes for 2 millisecond and then does 1/0 for 4 milliseconds. Assume no contention for the resources and the order of execution (priority) is A, B and C. a) Calculate the processor utilization without multiprogramming. b) Calculate the processor utilization with multiprogramming. c) Assume that the computer system has 512 Mbytes of available memory. What is the memory utilization with multiprogramming if Process A requires 256 Mbytes, Process B requires 128 Mbytes and Process C requires 64 Mbytes of memory. Note that: all processes are submitted for execution at the same time. d) What would be the total job duration, if these processes were executed on a multi-processor system with two processors?

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 11P

See similar textbooks

Similar questions

We are dealing with 6 processes p1;p2; : : : ;p6:(a) Processes p1;p2 in p3 arrive at time 2 ms, respectively. Each of those processesneeds 5 ms of CPU time.(b) Process p4 arrives at time 10 ms and needs 3 ms of CPU time.(c) Processes p5 in p6 arrive at time 19 ms. Process p5 needs 7 ms, while process p6needs 4 ms of CPU time.Scheduling is preemptive, where there process switch takes 1 ms. For the Round-Robinalgorithms with quantum 2 ms illustrate the execution of those processes on a timeline.Then determine the average turnaround time.
Suppose we have three processes P0, P1, and P2. Process P0 executes statement S0 and process P1 executes statement S1 and process P2 executes statement S2. Use wait and signal to ensure the following: S2 is always executed before S1 and S1 is always executed before S0S0.
ProcessBurst Time Priority Arrival TimeP1 10 3 0P2 1 1 0P3 2 5 0P4 1 4 0P5 5 2 0For the set of processes directly above, draw a Gantt chart for the FCFS Scheduling Algorithm.
At times t = 0, 1, and 2 seconds, processes P1, P2, and P3 arrive in the Ready state, respectively. Suppose their execution times are 5 seconds, 4 seconds, and 3 seconds, respectively. Show how they will be scheduled using round robin scheduling with a quantum of 3 seconds. Calculate the average turnaround time per process.
please select only correct option : 1) In ………………. only one process at a time is allowed into its critical section * a, Synchronization b, Mutual Exclusion c, Deadlock d, All of the given 2) To avoid race condition, ____ process(es) at a time can manipulate the shared variable. * a, One b, Two c, Three d, None 3) Process synchronization can be done through * a, Hardware b, Software c, Both Hardware and Software d, None of the given 4) For better memory-space utilization ________ is used a, Dynamic loading b, Static loading c, Dynamic linking Static linking d, All of the given 5) Peterson algorithm is restricted to ___ processes * a, One b, Three c, Five d, None of the given
Consider a program that performs the following steps repeatedly: Use the CPU for 4 milliseconds. By issuing an I/O, use the disk for 14 milliseconds. Use the CPU for 10 milliseconds. By issuing an I/O, use network for 18 milliseconds. Assume that each step depends on data obtained from the previous step (e.g., step 3 cannot start before step 2 is completed. Also assume that each resource (CPU or disk or network) can be used by one process at a time. Answer the following questions: (a) Draw 3 time-line diagrams (horizontal axis is the time line; one line for each resource. That is, 3 parallel rows in the resulted figure.) that illustrate the utilizations of the CPU, disk, and network over the execution of two iterations of the program above by a single process. (b) What are the average utilizations of the CPU, disk and network over these two iterations? (Please note that the “total time” should be the same across all resources, from the entire system starts until all work on any…
Below the Gannt chart of four processes P1, P2 ,P3 and P4 using SJF algorithm. process, then find the average waiting time. Write a table of a burst time for each
Given 4 processes P1, P2,P3,P4 with burst time 4,5,8,1 respectively. What will be the order in which the processes are scheduled according to SJF Algorithm. Assume that all the processes are available at t=0.
Given the following table, how will these processes be scheduled using RR algorithm with quantum = 5 ms and context switch time = 1 ms ? Create a Gantt chart showing when each process will be scheduled, and calculate the average waiting time, turnaround time and CPU utilization.
Given a set of processes and burst time draw the gantt chart and determine the average waiting time Shortest Job First Process Burst time P1 8 P2 4 P3 9 P4 5
Consider the processes P1,P2,P3 with burst time 3, 3, 24 respectively and arrival time = 0 ms what will be the average waiting time by applying FCFS scheduling algorithm.
Three processes and their service times are P1 = 200, P2 = 125, P3 = 70 are to be scheduled to run using the Round Robin Scheduling algorithm with a time slice of 50. Calculate the Turn Around Time for P2 (Assume they get scheduled to run in the order P1, p2, p3). a. 395 b. 345 c. 250 d. 270 e. 125