Question 2. Consider the following set of jobs to be scheduled for execution on a single CPU system. Arrival time burst time J1 123456 0 10 J2 2 8 J3 3 3 J4 10 4 J5 12 1 J6 15 4 Compute the turnaround time and total waiting time for each job using each of the following CPU schedulers: FCFS scheduling a. b. SJF scheduling b. C. Preemptive SJF scheduling MLFQ scheduling with three queues as follows: • Queue 1: 3 time slices • Queue 2: 6 time slices • Queue 3: FCFS (First-Come, First-Served)

Question 2. Consider the following set of jobs to be scheduled for execution on a single CPU system. Arrival time burst time J1 123456 0 10 J2 2 8 J3 3 3 J4 10 4 J5 12 1 J6 15 4 Compute the turnaround time and total waiting time for each job using each of the following CPU schedulers: FCFS scheduling a. b. SJF scheduling b. C. Preemptive SJF scheduling MLFQ scheduling with three queues as follows: • Queue 1: 3 time slices • Queue 2: 6 time slices • Queue 3: FCFS (First-Come, First-Served)

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 8RQ

See similar textbooks

Related questions

Q: Consider three processes, all arriving at time zero, with total execution time of 10, 20 and 30…

Q: In a timesharing OS we have the following cpu timeline for two tasks X and Y. The timeslice is 1s.…

A: Answer:-

Q: Race condition is the scenario that the same problem can finish at different time when running at…

A: According to our company's policy, we are obliged to answer only the first three questions, in case…

Q: An I/O-bound program is one that, if run alone, would spena more time waiting for I/O than using the…

A: This is a method of putting the Shortest Remaining Path Time First algorithm's principle into…

Q: In the context of process scheduling, what is the difference between preemptive and non- preemptive…

A: Modern operating systems allocate CPU resources to competing tasks using process scheduling. It…

Q: Suppose that there is only one CPU and we have five processes P1, P2, P3, P4, P5 all arrived at time…

A: We are given 5 processes which are scheduled based on priority scheduling algorithm. And priority is…

Q: Job scheduling: Consider the problem of scheduling n jobs of known durations t1, t2, . . ., tn for…

A: The Greedy Algorithm for Job Scheduling is a strategy employed to optimize the execution of a set of…

Q: Priority inversion is a condition that occurs in real time systems where a low priority process is…

A: In real time systems, the priority of processes determines the order in which they run on the CPU.…

Q: Job Scheduling: Consider the problem of scheduling n jobs of known durations t1, t2, ..., tn, for…

A: Greedy Algorithms One exemplary algorithmic worldview for moving toward improvement issues is the…

Q: Real-time Scheduling: Choose all true assertions. Rate Monotonic (RM) scheduling divides time into…

A: The question asks you to identify the true assertions regarding real-time scheduling, specifically…

Q: Consider a computer environment in which there are 4 magnetic drives, 2 printers, 3 scanners, and 1…

A: Deadlock: A deadlock is a condition where a program cannot access a resource it needs to continue.…

Q: e principal disadvantage of mapping is the complex circuitry required to examine the tags of all…

A: Q1. Here the correct option is (c) In Fully associative cache,any of the main memory block can be…

Q: Job Arrival Time CPU Cycle A 15 B 2 3 14 D 10 E Note: CPU Cycle = Burst Time Calculate which jobs…

A: A. FCFS Answer - by the time the first job A is finished, then next job will be B,C,D,E. B. SJN…

Question

SEE IMAGE this is for operating systems class

Consider the following set of jobs to be scheduled for execution on a single CPU system.
Arrival time burst time
J1 0 10
J2 2 8
J3 3 3
J4 10 4
J5 12 1
J6 15 4
Compute the turnaround time and total waiting time for each job using each of the following CPU
schedulers:
a. FCFS scheduling
b. SJF scheduling
b. Preemptive SJF scheduling
c. MLFQ scheduling with three queues as follows:
• Queue 1: 3 time slices
• Queue 2: 6 time slices
• Queue 3: FCFS (First-Come, First-Served

Question 2.
Consider the following set of jobs to be scheduled for execution on a single CPU system.
Arrival time
burst time
J1
123456
0
10
J2
2
8
J3
3
3
J4
10
4
J5
12
1
J6
15
4
Compute the turnaround time and total waiting time for each job using each of the following CPU
schedulers:
FCFS scheduling
a.
b.
SJF scheduling
b.
C.
Preemptive SJF scheduling
MLFQ scheduling with three queues as follows:
•
Queue 1: 3 time slices
•
Queue 2: 6 time slices
• Queue 3: FCFS (First-Come, First-Served)

Software system that manages computer hardware, software resources, and provide common services for computer programs.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Similar questions

If a microprocessor has a cycle time of 0.5 nanoseconds, what’s the processor clock rate? If the fetch cycle is 40% of the processor cycle time, what memory access speed is required to implement load operations with zero wait states and load operations with two wait states?
How does pipelining improve CPU efficiency? What’s the potential effect on pipelining’s efficiency when executing a conditional BRANCH instruction? What techniques can be used to make pipelining more efficient when executing conditional BRANCH instructions?
_____ is a CPU design technique in which instruction execution is divided into multiple stages and different instructions can execute in different stages simultaneously.
Processor R is a 64-bit RISC processor with a 2 GHz clock rate. The average instruction requires one cycle to complete, assuming zero wait state memory accesses. Processor C is a CISC processor with a 1.8 GHz clock rate. The average simple instruction requires one cycle to complete, assuming zero wait state memory accesses. The average complex instruction requires two cycles to complete, assuming zero wait state memory accesses. Processor R can’t directly implement the complex processing instructions of Processor C. Executing an equivalent set of simple instructions requires an average of three cycles to complete, assuming zero wait state memory accesses. Program S contains nothing but simple instructions. Program C executes 70% simple instructions and 30% complex instructions. Which processor will execute program S more quickly? Which processor will execute program C more quickly? At what percentage of complex instructions will the performance of the two processors be equal?
(Practice) Although the total number of bytes varies from computer to computer, memory sizes of millions and billions of bytes are common. In computer language, the letter M representsthe number 1,048,576, which is 2 raised to the 20th power, and G represents 1,073,741,824, which is 2 raised to the 30th power. Therefore, a memory size of 4 MB is really 4 times 1,048,576 (4,194,304 bytes), and a memory size of 2 GB is really 2 times 1,073,741,824 (2,147,483,648 bytes). Using this information, calculate the actual number of bytes in the following: a. A memory containing 512 MB b. A memory consisting of 512 MB words, where each word consists of 2 bytes c. A memory consisting of 512 MB words, where each word consists of 4 bytes d. A thumb drive that specifies 2 GB e. A disk that specifies 4 GB f. A disk that specifies 8 GB
Develop a program consisting of primitive CPU instructions to implement the following procedure: integer i,a; i = 0; while (i 10) do a = i2; i = i + 1; endwhile
A(n) ________________ instruction always alters the instruction execution sequence. A(n) ______________ instruction alters the instruction execution sequence only if a specified Condition is true.