Welcome! Log In Create A New Profile

Advanced

Dead locks || calculate safe state

Posted by Cornelvdw 
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
Forums Messages New
Cornelvdw
Dead locks || calculate safe state
October 19, 2008 03:04PM
How do you know which Process to select next ? I cant seem to figure this one out,
Reply Quote
Cornel@ipdimension.net
Re: Dead locks || calculate safe state
October 20, 2008 08:53AM
Anyone ?
Reply Quote
Cornelvdw
Re: Dead locks || calculate safe state
October 20, 2008 06:10PM
Never mind I figured it out,

Its actually very EASY! once you have snap it.
Reply Quote
faeezkana
Re: Dead locks || calculate safe state
October 22, 2008 03:39PM
Care to share???
Reply Quote
Cornelvdw
Re: Dead locks || calculate safe state
October 22, 2008 03:47PM
Need <= Available,

i.e (1,2,0) = need and (2,3,0) = available then it can go on because ( 1<2 || 2<3 || 0 <= 0)

You take it from the top each time, the first need that is < or = for all of them is the next process.
Reply Quote
faeezkana
Re: Dead locks || calculate safe state
October 22, 2008 03:52PM
So what u r saying is that every component of Need should be smaller than or equal to the components of work eg (1,4,0) = need and (2,3,0) = work then it cant go cos 4 > 3.
Reply Quote
Cornelvdw
Re: Dead locks || calculate safe state
October 22, 2008 04:00PM
need must be less or equals work... your 4 in need is not less that your 3 in work , this one wil not go.. if your need was eg 1,3,0 it will go
Reply Quote
faeezkana
Re: Dead locks || calculate safe state
October 22, 2008 05:18PM
Thanks.
Reply Quote
Newer Topic Older Topic
Sorry, only registered users may post in this forum.

Click here to login