Banker's algorithm: Difference between revisions

my @avail = <3 1 1 2>; # Available instances of resource

#my Maximum@allot R= that<1 can2 2 1>, <1 0 3 3>, <1 2 1 0>; # beResources allocated to processes

sub isSafe(\processes, \avail, \maxm, \allot) {

# While all processes are not finished or system is not in safe state

my $count = 0;

while $count < P { # Find a process which is not finish and whose needs

# can be satisfied with current @work resources.

my $found = False;

for ^P -> \p {

# First check if a process is finished, if no, go for next condition

if @finish[p] == 0 {

# Check if for allmy resources of current P need is less than work$satisfied;

LOOP: # Check if for ^Rall resources of current P need is ->less \jthan {work

$satisfied =LOOP: for ^R -> \j; {

last LOOP if @need[p;j] > @work[$satisfied = j];

} last LOOP if @need[p;j] > @work[j]

if $satisfied == R - 1 { # If all needs of p were satisfied.}

# Addif the$satisfied allocated== resourcesR of- current1 { # If all needs of Pp towere thesatisfied.

# available/ @work resources»+=« allot[p;^R]; # i.e.freeFree the resources

for ^R -> \k { @worksafeSeq[k$count] += allot[p;k] } # Add this process to safe sequence.

@finish[p] = 1; # AddMark this process top safeas sequence.finished

@safeSeq[ $count] += p1;

$countfound += 1;True }

}

# If wereturn couldFalse, not"System findis a next processnot in safe sequencestate." unless $found;

# Ifreturn systemTrue, is in safe state then safe"Safe sequence willis: be" as~ below@safeSeq

my ($safe-state,$status-message) = isSafe @processes, @avail, @maxm, @allot;