Welcome! Log In Create A New Profile



Posted by united 
Announcements Last Post
Announcement SoC Curricula 09/30/2017 01:08PM
Announcement Demarcation or scoping of examinations and assessment 02/13/2017 07:59AM
Announcement School of Computing Short Learning Programmes 11/24/2014 08:37AM
Announcement Unisa contact information 07/28/2011 01:28PM
March 17, 2007 07:49PM
The round robin scheduling algo is not supposed to put preempted proceses at the tail of the queue. I cant quite understand to the answer of ex 6.2 unit 6 in the study guide. Can anyone help?
Re: Ex6.2
March 23, 2007 04:14PM
This is how I understand it. Lets say we have 3 processes busy running, say P1, P2 and P3 (in that order, using RR scheduling). Now, just after process P2 has completed, P4 arrives. Even though P4 could theoretically execute now, it does not. What happens is, P3 and P1 will first want to execute, as they are already in the queue (in this scenario P1 is now last in the queue). This means that P4 wil be placed into the queue between P1 and P2, changing the execution order to P1, P4, P2 and P3. (basically when a new process enters, it gets put into the queue just before the process that was executed last).
This is the way I see it.
Hope it helps.
Re: Ex6.2
March 23, 2007 07:57PM
Sorry, only registered users may post in this forum.

Click here to login