Banker's algorithm: Difference between revisions

Content added Content deleted

Inline

@@ Line 971: / Line 971: @@
 sub isSafe(\work is copy, \maxm, \allot) {
     my \P          = allot.elems;     # Number of processes
+    my \Pool       = (^P).SetHash;    # Process pool
     my \R          = work.elems;      # Number of resources
     my \need       = maxm »-« allot;  # the need matrix
-    my @unfinished = True xx P;       # Mark all processes as unfinished
     my @safe-sequence;
@@ Line 980: / Line 980: @@
     while $count < P {
         my $found = False;
-        for ^P -> \p {
+        for Pool.keys -> \p {
-            # Check if process now can be finished
+            if all need[p] »≤« work {    # now process can be finished
-            if @unfinished[p] and all need[p] »≤« work {
                 work »+=« allot[p;^R];   # Free the resources
                 say 'available resources: ' ~ work;
                 @safe-sequence.push: p;  # Add this process to safe sequence
-                @unfinished[p] = False;  # Mark this process as finished
+                Pool{p}--;               # Remove this process from Pool
                 $count += 1;
                 $found = True