系统资源分配算法（System resource allocation algorithm）.docVIP

系统资源分配算法（System resource allocation algorithm） # includes stdio.h # includes stdlib.h # includes time.h # includes malloc.h # includes windows.h # includes string.h / * * * * * * * * * * * * * 定义全局变量 * * * * * * * * * * * * * / int available [10]; / / 可使用资源向量 int max [10] [10] = {0}; / / 最大需求矩阵 int allocation [10] [10] = {0}; / / 分配矩阵 int need [10] [10] = {0}; / / 需求矩阵 int work [10]; / / 工作向量 int finish [10]; / / 状态标志 int request [10]; / / 进程申请资源向量 int n = 3; / / 系统资源总数 int m = 5; / / 总的进程数 int pro [10]; / / 进程的顺序 / * * * * * * * * * * * * * * * * 函数声明 * * * * * * * * * * * * * / int check (int _ request request [], int k) _ request1 int check (int request [], int c) / * * 随机数字产生方法 * * / int random _ num () { int m; m = rand () 10. if (n = = 0) m = 1. return m; } / / 随机数函数结束 int check (int _ request request [], int k) { int j; for (j = 0, j n; j + +) { if (request [j] = need [k] [j]) { ; / / 当 request [j] = need [c] [j] 时无操作 } else { return 0; / / 当request [j] need [c] [j] 时, 表示所需的资源已经超过它宣布的最大值 break; } } return 1; } _ request1 int check (int request [], int c) { int j; int count = 0; for (j = 0, j n; j + +) { if (request [j] = available [j]) { count + +; } else { return 0; break; } if (count = = m) { for (j = 0, j m; j + +) { / / 试探性分配 available [j] = available [j] request [j]. allocation [c] [j] = allocation [c] [j] + [j] request; need [c] [j] = need [c] [j] request [j]. } } } return 1; } void user _ initial () { int i; int j; printf (请输入系统总共有的资源数:); scanf (% d, n). printf (请输入总共有多少个进程:); scanf (% d, a m); for (i = 0; i n; i + +) { printf (系统中% c类资源可用的资源实例, + 65). scanf (% d available []); } for (i = 0; i m; i + +) { for (j = 0, j n; j + +) { printf (进程p [% d] 对% c类资源的最大需求量: i, j + 65). scanf (% d, max [the] [j]). } for (j = 0, j n; j + +) { printf (该进程已经拥有的% c类资源数: j + 65). scanf (% d allocation [the] [j]). - [the] [j] = max [the] [j] [the] [j] allocation; } } } void printall _ work () { int i; int j; int k; printf (\ n系统进程信息: \ n \ n)