搜索资源列表
PC_Banker
- 用银行家算法实现进程死锁的检测和解决-with bankers algorithm Deadlock in the process of detecting and resolving
BA
- 操作系统中广泛应用的用于避免死锁的银行家算法的程序实现-operating system widely used for deadlock avoidance algorithm bankers Program
banker666
- 银行家算法,用来检验死锁问题-bankers algorithm, a test of deadlock. .
模拟银行家算法
- 利用银行家算法避免死锁。掌握银行家算法中的数据结构,算法的整个过程,并加深对银行家算法的理解-bankers algorithm used to avoid deadlock. Master bankers algorithm data structure, algorithm of the whole process, and deepen the understanding of Banker's Algorithm
banker-deadlock
- 解决进程死锁的银行家算法,vc++2005-settlement process Deadlock bankers algorithm, vc 2005
Bank_Algorithm
- 这是一个编程模拟实现死锁避免的银行家算法-This is a programming simulation deadlock avoidance algorithm bankers
死锁
- 模拟操作系统的进程死锁-simulated the process of operating system Deadlock
银行家计算机
- 应用银行家算法解决死锁问题-application bankers algorithm to solve deadlock
银行家算法
- 采用银行家算法实现死锁的避免-bankers algorithm used to avoid deadlock
bank0
- 银行家算法.解决死锁问题-bankers algorithm. Resolve Deadlock
哲学家进餐问题VC版
- 本程序是操作系统中比较典型的线程同步算法中的哲学家进餐问题,为防止死锁,采取了两个条件(筷子空闲)同时满足时再允许进餐的办法来解决。期望与大家一起学习交流!-the procedure is fairly typical operating system threads synchronization algorithm of the Dining Philosophers, in order to prevent deadlock and take the two conditions (ch
经典的理发师问题,用C语言实现
- 经典的理发师问题,用C语言实现,程序实现了几个进程之间的相互调度关系,预防死锁。,Classic barber problem using C language, the program realize a number of the process of scheduling the relationship between the prevention of deadlock.
PhilosopherDining.rar
- 在 WINDOWS 系统中实现哲学家就餐问题的死锁和不死锁两种解法。,WINDOWS system to achieve in the dining philosophers problem of deadlock and deadlock two solution.
banker
- 操作系统中解决死锁的银行家算法的演示算法-Operating system to resolve Deadlock banker
systemtest
- 本程序是操作系统课程实验的死锁的检测与解除。解除方式采用撤销进程的方法。全部用数组实现。在ubuntu(linux)下编译通过。为本人原创。每次撤销个代价最小的死锁进程,释放其所拥有的资源。 所有数据都是可以自行设置的,包括进程个数,资源种类数,各进程的代价等。-This procedure is the operating system course experiment Deadlock Detection and disarmament. The lifting of the way
yin
- 操作系统--银行家算法 实验目的: 1、对死锁避免中的银行家算法作进一步理解。 2、加深理解死锁的概念。 3、加深理解安全序列和安全状态的概念。 4、通过编程,掌握银行家算法分配资源的一步步实现过程。 -Operating system- bankers algorithm experimental purposes: 1, to avoid deadlock in the banker s algorithm for further understanding. 2,
2
- 银行家算法可以避免死锁。算法结构 n : 系统中进程个数 m :系统中的资源类数 1)available(m):现有资源向量 2) max(n,m):资源最大申请量 3)allocation(n,m):资源分配矩阵 4)need(n,m):进程以后还需要的资源矩阵 5)request(n,m):进程申请资源矩阵-Banker s algorithm to avoid deadlock. Algorithm structure n: the system proc
deadlock
- 操作系统课程设计:死锁问题。 哲学家进餐问题的解决!!!很好的操作系统大作业!-Operating systems curriculum design: Deadlock problem. Dining philosophers problem! ! ! Very good major operating system!
Deadlocks
- 本文档说明了死锁的概念和一些经典示例,并且介绍了如何避免死锁以及如何解决死锁问题。-This document describes the concept of deadlock and some classic examples, and describes how to avoid deadlock and how to solve the deadlock.
Deadlock-philosopher
- 实现了不死锁的哲学家问题(进程同步互斥),有简单界面,有图。-Deadlock philosopher (process synchronization mutual exclusion), simple interface, there are plans.