Welcome! Log In Create A New Profile

SJF Scheduling

Posted by Kyle

Announcements		Last Post
	SoC Curricula	09/30/2017 01:08PM
	Demarcation or scoping of examinations and assessment	02/13/2017 07:59AM
	School of Computing Short Learning Programmes	11/24/2014 08:37AM
	Unisa contact information	07/28/2011 01:28PM

Forums Messages New

Kyle

SJF Scheduling
April 12, 2010 09:07PM

Registered: 16 years ago
Posts: 284
Rating: 0

Hey all,

Has anyone figured out how to do the SJF scheduling Gantt chart according to Tut 102? I look at it, I can't find any information anywhere and can't figure out (with certainty) how they build it. I know it's too late for the assignment, but I reckon it's important to understand.

Thanks,

Kyle

Reply Quote

AndreB

Re: SJF Scheduling
April 24, 2010 12:18AM

Registered: 18 years ago
Posts: 1,501
Rating: 0

Kyle - the Non pre-emptive SJF (Shortest Job First) scheduling is not too complicated.
At each switch the process or job with the shortest burst time is selected. If there is a tie, i.e. 2 processes have the same burst time, then the process closer to the front of the queue is selected.
It gets a little trickier when the jobs arrive at different intervals. Simply evaluate which jobs exist at the time the switch occurs, then simply select the job with the shortest burst time.