2. 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 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: A. Calculate the average waiting time, average turnaround time.

2. 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 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: A. Calculate the average waiting time, average turnaround time.

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

Related questions

Q: Suppose a byte-addressable memory with 4 frames of size 32 bytes each and a paged virtual memory…

A: I will explain it in details,

Q: Consider a system running ten I/O-bound tasks and one CPU-bound task. Assume that the I/O-bound…

A: The question has been answered in step2

Q: Consider a system with 3 I/O devices •Printer (priority of 2) •Disk (priority of 4)…

A: Step 1:- Given:- Consider a system with 3 I/O devices •Printer (priority of 2) •Disk (priority of 4)…

Q: On a single CPU system, we have 2 processes running concurrently, with the same I/0 percentage in…

A: Answer :l

Q: Consider the following processes: Process Arrival Time Service Time A 0 4 B 1 3 C 2 3 D 2 2 E 3 1 F…

A: FCFS (First-Come-First-Serve) with a Single Ready Queue:In this approach, all processes are placed…

Q: rst (ms)

Q: Polling for an I/O completion can waste a large number of CPU cycles if the processor iterates a…

A: Answer is

Q: Consider the following set of processes, with the length of the CPU burst and I/O burst given in…

Q: onsider a system with 3 I/O devices Printer (priority of 2) Disk (priority of 4) Communication line…

A: Interrupt Interrupt is a signal raised by software or hardware to get immediate attention of…

Q: Consider the following set of processes, with the length of the CPU burst given in milliseconds.…

A: CPU scheduling:- CPU scheduling is a key aspect of operating systems that deals with the management…

Q: Consider a system running ten I/O-bound tasks and one CPU-bound task. Assume that the I/O-bound…

A: In a round-robin scheduling algorithm, each process is assigned a fixed time quantum during which it…

Q: Given in Table 1 is a set of five (5) processes with the priority, length of the CPU-burst time, and…

Q: Given a computer using a byte-addressable virtual memory system with a two-entry TLB, a 2-way set…

A: We have , Page size = 16 Bytes No. of bits required to represent…

Question

2. 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
lo
P2
2, 1, 4
14
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:
A. Calculate the average waiting time, average turnaround time.
B. With respect to each metric justify which scheduling algorithm is good for the given process mix.

Expert Solution

This question has been solved!

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

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Similar questions

PLEASE ONLY NEED ANSWER FOR QUESTION 2 (THE PSEUDOCODE) THANKS
Suppose that we have the table below that includes four processes with their Arrival times and Burst times, and a Round Robin of time quantum 1 millisecond to be used for CPU scheduling. Answer the following questions: Process Arrival CPU-burst ID time time P1 0 1 P2 3 3 P3 2 4 P4 4 3 Completion Time Response Turn Around Time Time Waiting Time a. Draw the Gantt chart. b. Complete the above table. c. Calculate the average waiting time.
Three periodic processes of an operating system has P(burst time, period) as follows: P1(4,20), P2(6,10), P3(12,30). Which of the following is true when these processes are scheduled with Rate-Monotonic scheduling algorithm that assigns priorities proportional to periods (shorter period has higher priority). a)No process misses a deadline b)Only P3 misses its deadline c)P1, P2 and P3 all miss their deadlines d)P2 and P3 both miss their deadlines
Consider the following set of 5 processes, with the length of the CPU-burst time given in milliseconds arriving at time 0: P1, P2, P3, P4, and P5 with corresponding burst time: 20, 47, 13, 17 and 22. The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. a. Calculate average waiting time for First Come First Serve and None Preemptive Shortest Job First CPU scheduling algorithms. b. Which of the schedules in part a results in the minimal average waiting time (over all processes)?
Consider the following table of set of processes, assumed to have arrived at time 0 in the order P1, P2, P3, P4, P5, with the length of the CPU burst given in milliseconds. Process P1 P2 P3 P4 P5 CPU burst time 8 1 2 1 5 2. Non-Preemptive Priority. 3. RR (Time Quantum = 6). Priority 5 1 3 4 2 a. Design the flow of processes in a Gantt chart using each of the following algorithms: 1. FCFS.
A system implements a paged virtual address space for each process using a one-level page table. The maximum size of virtual address space is 16MB. The page table for the running process includes the following valid entries (the → notation indicates that a virtual page maps to the given page frame, that is, it is located in that frame): Virtual page 2 → page frame 4 Virtual page 4 → page frame 9 Virtual page 1 → page frame 2 Virtual page 3 → page frame 16 Virtual page 0 → page frame 1 The page size is 1024 bytes and the maximum physical memory size of the machine is 4MB. a) Show the virtual address format including the name and size of the fields. b) Show the physical address format including the name and size of the fields. c) What is the maximum number of entries in a page table? d) To which physical address will the virtual address 0xAF4 e) Which virtual address will translate to physical address 0x4000? (read the question carefully)