CORRECTION: At 4.40 I compared process time(20,30,10) but here we will compare the total CPU Burst time only to select the shortest job. CPU Burst Time for P1 = 10(excluding IO time), P2 = 15, P3 = 5. So we compare (10,15,5) and allocates the CPU to P3 as it is having shortest Burst Time.
mam.... I am big fan of your way of lecturer and your good voice and also your face you Know one thing when you're on lecturer something.... like angel teach for us.... thanks you mam.......
From google: "Response Time: Duration between job submission and getting the first time to be executed by CPU. Waiting Time: Amount of time the job is present in the ready queue." But in the video (@17:30), you included the I/O Burst time with the Waiting Time. I feel like that was wrong.
I/O burst time is not considered because in that time CPU is not used. We are calculating the Wait time for CPU, so we need to consider burst times when CPU was used by respective process.
Maam ,In an earlier video, you had told that waiting time = time spent by process in ready queue waiting for CPU. But in the above example, IO burst time is also considered to be part of wait time. How is this valid? . Process neither is waiting for the CPU in that IO burst time nor it is in ready queue. So actually WT = TAT- BT. where BT = CPU BT + IO BT. Am I ryt?
hi mam.. plz ,jy iska answer solve kar dain Question 2: Consider a single processor system supporting two running processes, A and B, with the following sequential execution patterns: A: [CPU 8ms; IO 1ms; CPU 8ms; IO 1ms; CPU 8ms] B: [CPU 2ms; IO 1ms; CPU 2ms; IO 1ms; CPU 2ms] Assume that IO operations do not interfere with each other and are blocking, and that scheduling and context switch times are negligible. (i) What is the total elapsed time for the two processes to run to completion? [2 marks] (ii) Assume the system runs a non-preemptive scheduler where processes are scheduled in the order in which they become runnable, and that B takes priority over A in the event of a tie. Give the combined execution pattern of the two processes in the format as given and determine the total elapsed time for the two processes to run to completion. [5 marks] (iii) Repeat part (ii) with a pre-emptive scheduler operating with a time slice of 4ms. [5 marks] (iv) What are the costs and the benefits of a pre-emptive over a non-preemptive scheduler for this workload, which would you choose, and why? plz mam plzzzzzzzzzz help me
Now suppose that 4 processes out of 5 processes are CPU-bound and one process is I/O bound and receives one character per second of user typing, that it processes for 10ms and then blocks again waiting for the next. Is this unfair? Is this an undesirable situation for the user of the I/O bound process thats my question reply me mam
the following set of processes with their CPU burst times/Processing time (milliseconds), arrival times (milliseconds) and priorities. For example, process P1 arrives 11 milliseconds after the start of the system; process has priority (8, 6, 2, 5, 1). is question ka solution bata dan
if the algorithm is non pre-emptive,then waiting time should b equal to respose time(WT=RT) na ma'am like u said in SJF.......but here,its not same........y ma'am????
Consider the set of 5 process whose arrival time and burst time are given below in milliseconds. Process ID Arrival time Burst time P1 0 4 P2 1 2 P3 2 1 P4 3 3 P5 4 2 if the CPU scheduling policy is Round Robin with time quantum = 2 unit. Calculate average waiting time and turn around time. plss solve tjiz
CORRECTION: At 4.40 I compared process time(20,30,10) but here we will compare the total CPU Burst time only to select the shortest job.
CPU Burst Time for P1 = 10(excluding IO time),
P2 = 15,
P3 = 5.
So we compare (10,15,5) and allocates the CPU to P3 as it is having shortest Burst Time.
ma'am 10,15,5 are the i/o burst time not cpu burst time
we will compare 6,9,3 as they are cpu burst time
@@nitinverma2808 if we sum up the burst times we shall get 10,15 and 5 only respectively sir.
i realize I'm kinda off topic but do anyone know a good website to stream new movies online?
@Kaleb Reign i would suggest Flixportal. Just search on google for it :)
*Always a random Indian guy saves ma university life*
ma
Man Indian professors are literally the best teachers... all my professors at sdsu suck
hello fellow SDSU student
qaxalee abbaa keetii jabaadhu!
She actually calculated WAITING TIME wrong as I/O time is not calculated in waiting time.
mam.... I am big fan of your way of lecturer and your good voice and also your face you Know one thing when you're on lecturer something.... like angel teach for us.... thanks you mam.......
so there are two things to be kept in mind :
1) compare the given processes with their corresponding cpu time
2) wt=tt-cpu burst time
teaching style is so good
Thanks for help mam. Best vedio uploaded
From google:
"Response Time: Duration between job submission and getting the first time to be executed by CPU. Waiting Time: Amount of time the job is present in the ready queue."
But in the video (@17:30), you included the I/O Burst time with the Waiting Time. I feel like that was wrong.
I/O burst time is not considered because in that time CPU is not used. We are calculating the Wait time for CPU, so we need to consider burst times when CPU was used by respective process.
Maam ,In an earlier video, you had told that waiting time = time spent by process in ready queue waiting for CPU. But in the above example, IO burst time is also considered to be part of wait time. How is this valid? . Process neither is waiting for the CPU in that IO burst time nor it is in ready queue. So actually WT = TAT- BT. where BT = CPU BT + IO BT. Am I ryt?
Waiting Time = Time spent in waiting for I/O completion
Response Time = Time spent in ready queue after the arrival
Mam plz make aa video for system call interface for process management ,fork,wait,waitpid,exit,exec
Refer nesco academy
Great video mam
We do not include I/o time in waiting time. It is only time spent in ready queue
Jab tujhe pta tha to kyu pta krne aaya yha pr😂😂
hi mam.. plz ,jy iska answer solve kar dain
Question 2: Consider a single processor system supporting two running processes, A and B, with the following sequential execution patterns:
A: [CPU 8ms; IO 1ms; CPU 8ms; IO 1ms; CPU 8ms]
B: [CPU 2ms; IO 1ms; CPU 2ms; IO 1ms; CPU 2ms]
Assume that IO operations do not interfere with each other and are blocking, and that scheduling and context switch times are negligible.
(i) What is the total elapsed time for the two processes to run to completion?
[2 marks]
(ii) Assume the system runs a non-preemptive scheduler where processes are scheduled in the order in which they become runnable, and that B takes priority over A in the event of a tie. Give the combined execution pattern of the two processes in the format as given and determine the total elapsed time for the two processes to run to completion.
[5 marks]
(iii) Repeat part (ii) with a pre-emptive scheduler operating with a time slice of 4ms.
[5 marks]
(iv) What are the costs and the benefits of a pre-emptive over a non-preemptive scheduler for this workload, which would you choose, and why?
plz mam plzzzzzzzzzz help me
Ur lecture is very helpful 10q
Thank You so much
Amitabh Bachchan (22:07) in the end😆😆 watch at 2x .
You should learn to Respect your teacher.
Ic question per SJF scheduling per yah tu nahi likha premtive yah non premtive sa karna h????????????????
Now suppose that 4 processes out of 5 processes are CPU-bound and one process is I/O
bound and receives one character per second of user typing, that it processes for 10ms
and then blocks again waiting for the next. Is this unfair? Is this an undesirable situation
for the user of the I/O bound process thats my question reply me mam
in non preemptive waiting must be equal to response time know mam
Did u figure out why response time is not equal to waiting time here?
ideal time is the time CPU doesn't do any work then how it refers to its efficiency. Efficiency of CPU = CPU utilization.
the following set of processes with their CPU burst times/Processing time (milliseconds), arrival times (milliseconds) and priorities. For example, process P1 arrives 11 milliseconds after the start of the system; process has priority (8, 6, 2, 5, 1).
is question ka solution bata dan
if the algorithm is non pre-emptive,then waiting time should b equal to respose time(WT=RT) na ma'am like u said in SJF.......but here,its not same........y ma'am????
Will scheduling of processes happen in blocked state also?
Thank you mam 😊
from where i can download all data structure videos
U can watch and save from RUclips
Thank you...
Can you please add more videos for scheduling with I.O for priority preemptive 🪽✨️
Thank you mam
Great mam......
Consider the set of 5 process whose arrival time and burst time are given below in milliseconds.
Process ID Arrival time Burst time
P1 0 4
P2 1 2
P3 2 1
P4 3 3
P5 4 2
if the CPU scheduling policy is Round Robin with time quantum = 2 unit. Calculate average
waiting time and turn around time.
plss solve tjiz
great video. u r looking beautiful. 😍
I can't focus on the concept because you are so beautiful..
hahaha
Why so serious
thank you.------------------------you looking tooooooooooooooooo cute.
Your face is very very dutifully
I love you medam
Thank you so much