Description: one. Algorithm introduced :** Data Structure : 1. The resources available vector Available 2. The biggest demand matrix Max 3. Allocation distribution matrix 4. Need** demand matrix function presentations : Simulation of bankers Dijkstra algorithm to avoid the emergence of deadlock. Composed of two parts : Part I : bankers algorithm (scanning) 1. If Requestlt; = Need, has turned two Otherwise, the two errors. If Requestlt; = Available, has turned three, or wait for the three. System testing requested resource allocation process to four. Safety system for the implementation of the second part of algorithm : a security algorithm. Set up two vector (1). Vector work : Work = Available (expressed system available to the continued operation of the process required number of resources of all ki
File list (Check if you may need any files):
Download