搜索资源列表
死锁—哲学家吃饭问题
- 死锁—哲学家吃饭问题 java写的-Deadlock-food philosopher wrote java
bin
- philosopher the algorithm of deadlock
vc_semaphore
- 自己写的。用信号量机制来解决哲学家问题中的死锁。附有详细注解。-wrote it myself. Using signal volume philosopher mechanism to solve the problem of deadlock. Accompanied by a detailed explanation.
银行家计算机
- 应用银行家算法解决死锁问题-application bankers algorithm to solve deadlock
银行家算法
- 采用银行家算法实现死锁的避免-bankers algorithm used to avoid deadlock
bank0
- 银行家算法.解决死锁问题-bankers algorithm. Resolve Deadlock
死锁检测模拟
- 死锁检测模拟程序-Deadlock Detection Simulation Program
DEADBRK.ZIP
- Measures Overhead in Breaking A 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
jch
- 这是一个进程同步的程序，可以判断死锁的问题，是可以支持多进程的程序。-This is a process synchronization procedures can be judged Deadlock problems, can support multi-process procedures.
防死锁的程序
- 可以防止死锁,而让攻击者不是很容易着手去攻击你-can prevent deadlock and allow an attacker is not very easy to start to attack you
os-banker
- 操作系统中银行家算法的演示程序，银行家算法是避免死锁的方法，避免死锁的法则是，系统在运行过程中，对于进程的每一种资源请求都要根据预掌握的资源使用信息，按照一定的算法，进行是否可能导致死锁的预测，以决定是否同意这一资源请求。这是向前看几步，知道保证不会导致死锁时再向前走一步的具有动态性质的预测算法。-operating system bankers algorithm Demonstration Program, bankers algorithm is a method to avoid dea
APIHookingPart3_src
- This the third, fourth (and last) part for building a thread deadlock detector. Please see the first and second article to understand wait is going on : A (working) implementation of API hooking (Part II)
进程安全性算法
- 操作系统进程检测死锁模拟银行家算法，安全性算法-operating system simulation process Deadlock Detection Algorithm bankers, security algorithm
BANK_bank
- 主要是用语解决死锁问题的算法,也称之为银行家算法,希望可以用的上!-term solution is mainly the deadlock algorithm, also known as bankers algorithm can be used to hope!
银行家算法解决死锁
- 应用银行家算法解决死锁问写的银行家算法，只能实现固定进程和资源的操作，不过要是应付作业什么的没有问题，绝对可以运行 -application bankers algorithm to solve the deadlock was asked bankers algorithm, the process can only be fixed and operational resources, but what if the deal with no operational problems and
zy19810412
- 在计算机操作系统中，最有代表的避免死锁的算法，是Dijkstra银行家算法。这是由于该算法能用于银行系统现金贷款的发放而得名的。为了加深对该算法的认识和掌握，进而在计算机上实现。为了实现银行家算法，系统中必须设置若干数据结构。-in computer operating systems, and most representative of the deadlock avoidance algorithm is Dijkstra algorithm bankers. This is becaus
yhj111
- 银行家算法 进程控制中用到的算吧 检测是是否死锁-bankers process control algorithms used in the counting detection is whether it Deadlock
经典银行家算法
- 模拟实现银行家算法。通过编写和调试一个系统动态分配资源的简单模拟程序，观察死锁产生的条件，并采用银行家算法，有效的避免死锁。-Simulation Algorithm. By compiling and debugging a system dynamic allocation of resources simple process simulation, the observation Deadlock conditions, and using bankers algorithm, effe
yhj
- 银行家算法是避免死锁的一种重要方法，本实验要求用高级语言编写和调试一个简单的银行家算法程序。加深了解有关资源申请、避免死锁等概念，并体会和了解死锁和避免死锁的具体实施方法-bankers avoid deadlock algorithm is an important method used in this experiment demands high-level language debugging and prepared a simple algorithm bankers proced