search
Log In
0 votes
110 views
If the jobs are  non-premptive, then the avg waiting and avg response time will be the same? w.r.t any scheduling algo?
in Operating System
edited by
110 views
0
no they will not be same
0
But true for fcfs?
0
FCFS is always non-premptive ..so yes
0
non pre -emptive*

.

and it wont be ever equal...

as response time is : first response - arrival time

    waiting time :        turn around time - burst time

.

its not true for every cases... for any particular caSe it may satisfy but not for all...

1 Answer

0 votes
 
Best answer
Response time is the first time the job gets the CPU, precisely speaking (First time the jobs get the CPU - Arrival time),so if considered different scheduling algorithm the time at which the jobs gets the CPU will be different.

ex:J1,j2 are jobs with 0 and 1 Arrival time and 3 and 2 burst time, so in FCFS the J1 gets CPU first and in SJF J2 gets it first..So response times are different.

and Waiting time is TAT-BT where TAT=CT-AT, so indirectly waiting time is dependent upon CT and AT,but considered different scheduling algorithm the CT will be different.

Hence for same job set (J1,J2,J3,J4) the average WT and avg RT will be different.

It will be same only in case of FCFS when all jobs Arrival Time is same.

selected by

Related questions

2 votes
1 answer
1
349 views
To calculate EMAT in case of page fault we used: EMAT= page fault rate*(page fault service time) + (1-page fault rate)*(memory access time) My doubt is: In case of NO PAGE FAULT, why we considered only one memory access time . Why not two memory ... , You considered (VA -> PA time) + memory access time. Then why not we consider address translation time in questions involving only pagefault?
asked Sep 22, 2019 in Operating System tp21 349 views
0 votes
3 answers
2
565 views
I have read that paging does not suffer from external fragmentation as the frames and the pages are all of the equal sizes, but when we store a last level page table in a frame at that time it may not fully occupy the frame. Similarly, if n such page ... gaps exceed a page size. Then there should be external fragmentation, right? So why is it said that paging does not have external fragmentation?
asked Jun 13, 2019 in Operating System Hirak 565 views
0 votes
0 answers
3
206 views
User level threads doesnot require context switching- This is a true statement (Because OS cannot recognize user level threads) Can somebody elaborate more on it?? This given answer is wrong I think:https://gateoverflow.in/290648/made_easy_test_series Plz check
asked May 19, 2019 in Operating System srestha 206 views
0 votes
1 answer
4
168 views
If a page is not present in the memory, then its corresponding entry in the page table would have the ‘Present’ bit set as 0 to indicate , the page is not present. Will this entry be considered for caching in TLB? As I understand from above line in Tanenbaum, The entry should not be present in TLB. Is my understanding right?
asked May 9, 2019 in Operating System Mayank0343 168 views
...