Data-Structures
October 11, 2023Data-Structures
October 11, 2023Process-Scheduling
| Question 6 |
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?
| q ≤ t-ns/n-1 | |
| q ≥ t-ns/n-1 | |
| q ≤ t-ns/n+1 | |
| q ≥ t-ns/n+1 |
Question 6 Explanation:
Correct Answer: A
Question 6 Explanation: