Description: Deadlock Avoidance Algorithm implementation- one banker' s algorithm, the program running at the beginning of all available resources. About 10 kinds of types of resources, each resource number 1 ~ 10.2, continuously randomly generated or manually enter a new " process of resource requirements vector," and fill in the greatest demand matrix. 3, in the process the greatest number of the scope of the demand (and therefore beyond the scope of required testing), for the process of randomly generated or manually enter the resource requests. By the banker' s algorithm output system after the information is safe. When a process requests resources hair after all, consider it to end
File list (Check if you may need any files):
yinhangjia.cpp
Download