GATE - 1998 | OS | Consider n processes sharing the CPU in a round-robin fashion.

GATE - 1998 | OS | Consider n processes sharing the CPU in a round-robin fashion.
Posted on 28-02-2022

GATE - 1998 [Operating System]

Question:

Consider n processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes s seconds, what must be the quantum size q such that the overhead resulting from process switching is minimized but, at the same time, each process is guaranteed to get its turn at the CPU at least every t seconds?

Consider n processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes s seconds, what must be the quantum size q such that the overhead resulting from process switching is minimized but at the same time each process is guaranteed to get its turn at the CPU at least every t seconds?

Solution:

Option (A) is Correct.

Consider n processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes s seconds, what must be the quantum size q such that the overhead resulting from process switching is minimized but at the same time each process is guaranteed to get its turn at the CPU at least every t seconds?

 

Thank You

Latest Jobs

Also Read About

GovtVacancy.Net updates latest government vacancies to help the new aspirants to know about the new government jobs and upcoming government jobs. we update the daily latest government vacancies on our portal for all government job aspirants of all the states of India. govtvacancy.net is not affiliated with any government website. All information provided here is for education purposes only. Govt Exam Preparation like SSC UPSC Railways. We Teach Subjects like Science, Maths, History, Geography, Psychology, Economics. We do not claim any facts and figure stated here. Read more on the disclaimer.

©2022 GovtVacancy. All rights reserved

Developed by Om Prakash

Funded by OJB FRP

Email-: [email protected], [email protected]