Banker s Algorithm, Dijkstra 1965 (single resource)  Checks whether a state is safe 1.Pick a process that can terminate after fulfilling the rest of its requirements (enough free resources) 2.Free all its resources (simulation) 3.Mark process as terminated 4.If all processes marked, report safe , halt 5.If no process can terminate, report unsafe , halt 6.Go to step 1 Operating Systems, 2014, Meni Adler, Danny Hendler & Amnon Meisels 32
{}