In a batch operating system, three jobs are submitted for execution. each job involves and I/O activity, CPU time and another I/O activity of the same time span as the first. Job JOB1 requires a total 23ms, with 3ms CPU time;JOB2 requires requires a total time of 29 ms with 5ms CPU time; JOB3 requires a total time of 14 ms with 4ms CPU time. Illustrate their execution and find CPU utilization for uniprogramming and multiprogramming systems. Also,Graphical representations and numeric calculations are expected to be showned.

In a batch operating system, three jobs are submitted for execution. each job involves and I/O activity, CPU time and another I/O activity of the same time span as the first. Job JOB1 requires a total 23ms, with 3ms CPU time;JOB2 requires requires a total time of 29 ms with 5ms CPU time; JOB3 requires a total time of 14 ms with 4ms CPU time. Illustrate their execution and find CPU utilization for uniprogramming and multiprogramming systems. Also,Graphical representations and numeric calculations are expected to be showned.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter4: Processor Technology And Architecture

Section: Chapter Questions

Problem 2PE: If a microprocessor has a cycle time of 0.5 nanoseconds, what’s the processor clock rate? If the...

See similar textbooks

Similar questions

In a multiprogrammed environment with 32MB of RAM where all processes require9MB of unshared RAM and spend 40% of their time in I/O wait, calculate themaximum achievable CPU utilization. If the RAM available is increased by 700%and time spent in I/O wait increases by 100%, calculate how much RAM will remainunused when CPU utilization is just above 99%.
In a batch operating system, four jobs JOB1, JOB2, JOB3, JOB4 are submitted for execution. Each job involves an I/O activity, followed by a CPU time, followed by another I/O activity of the same time span as the first. Each job is associated with a different I/O device. JOB1 requires a total of 11 ms, with 1 ms CPU time. JOB2 requires 10 ms total time with 2 ms CPU time. JOB3 requires 56 ms total time with 8 ms CPU time. JOB4 requires 19 ms total time with 5 ms CPU time. Assume a multiprogramming system and answer the following:1.What will be the total time to complete all jobs? 2. What will be the CPU utilisation? 3. What will be the turnaround time of JOB4? 4 .What will be the average turnaround time?
3.1 What will be the total time to complete all jobs? 3.2 What will be the total CPU time? 3.3 What will be the CPU utilisation?
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…
Four jobs arrive at a batch processing system at the same time and the execution time of each job is 2 hours. They run on a single processor. The average time for the jobs to finish is … a.hours b. 4 hours c. 5 hours d. 8 hours e. 1 hour
In a batch operating system, four jobs JOB1, JOB2, JOB3, JOB4 are submitted forexecution. Each job involves an I/O activity, followed by a CPU time, followed byanother I/O activity of the same time span as the first. Each job is associated witha different I/O device. JOB1 requires a total of 13 ms, with 3 ms CPU time. JOB2requires 10 ms total time with 2 ms CPU time. JOB3 requires 56 ms total time with8 ms CPU time. JOB4 requires 19 ms total time with 5 ms CPU time.
In a batch operating system, four jobs JOB1, JOB2, JOB3, JOB4 are submitted forexecution. Each job involves an I/O activity, followed by a CPU time, followed byanother I/O activity of the same time span as the first. Each job is associated witha different I/O device. JOB1 requires a total of 11 ms, with 1 ms CPU time. JOB2requires 10 ms total time with 2 ms CPU time. JOB3 requires 56 ms total time with8 ms CPU time. JOB4 requires 19 ms total time with 5 ms CPU time.Assume a uni-programming system and answer the following: 3.1 What will be the total time to complete all jobs? 3.2 What will be the total CPU time? 3.3 What will be the CPU utilisation? Assume a multiprogramming system and answer the following:3.4 What will be the total time to complete all jobs? 3.5 What will be the CPU utilisation? 3.6 What will be the turnaround time of JOB4? 3.7 What will be the average turnaround time?
NOTE: "Exekveringstid(ms)" means execution time or burst time in milliseconds Assume that a system with a CPU at one time has the following processes queued in the CPU's READY queue: Calculate the waiting time for the seven processes: 1) If FCFS is being used 2) If LRU is being used 3) If RR with time quantum of 8ms
What is the minimum and maximum number of processes taht can be in the ready, running and blocked states of a systen with n CPUs?
Find the ratio of CPU utilization for a system spend 120 minutes to execute the processes and the total latency (Context switch time) time is 20 minutes.
Consider the following processes and their associated threads running on a multiprocessor system: Process Thread Arrival Time CPU Burst I/O Burst Total CPU Time X X1 0 4 2 11 X2 3 2 4 5 X3 3 2 4 5 Y Y1 5 6 2 14 Y2 5 3 5 7 Z Z1 7 1 1 6 Z2 7 3 2 10 Create a scheduling simulation for these threads on a system with two (2) processors using the First Come First Served (FCFS) algorithm. A thread may migrate from one processor to another if it returns from blocked waiting time and 1) the processor it was running on previously is occupied with other work; and 2) and the other processor is available to execute the thread. If both processors are available when a thread becomes unblocked, it will remain on the processor it was most recently running on. In this simulation, you will be managing a single ready queue that schedules all processes. When two processes arrive in the ready queue at…
According to Amdahl's Law, what is the maximum possible % reduction in execution time when:process A, which currently runs 19% of the time, is optimized to run faster.