搜索资源列表
SimulationoftheDiningPhilosophersProblem
- 计算机仿真的实验，用三种方法模拟了哲学家进餐的过程，图形化的显示过程，用VC++.net开发的。-computer simulation experiments, using three methods to simulate the process of the Dining Philosophers, graphical display process, VC. net development.
ChopStickTest
- 哲学家就餐问题java版。我对这个知道的不多，大家可以研究研究。-dining philosophers problem java version. I know this much, and we can studies.
jincan
- 哲学家进餐问题 在多线程中如何避免死锁。 简单源码，有参考价自己 -dining philosophers problem in multithreaded how to avoid deadlock. Simple source, a reference price of its own
vc++eatingcode
- 非常经典的哲学家进餐问题（与进程有关）有三个哲学家围着一张桌子，桌子上摆着一碗通心粉；桌子上有且只有三支筷子，且每只筷子摆放在每两个哲学家中间；哲学家必须得到两支筷子才能吃饭，否则就处于思考状态；每个哲学家取筷子必须先取得左边，而后取右边的。 -very classic philosophers dining (with the process) is a three philosophers around the table, o
zhexuejiajincan2
- 在Linux环境下，使用共享外部变量的方式，实现哲学家进餐问题-the Linux environment, the use of shared external variables, to achieve the Dining Philosophers Problem
PHI
- 哲学家就餐问题，显示线程的关系，采用信号量产生互斥的功能-Dining philosophers problem, show the relationship between threads, using semaphore have mutually exclusive features
philosopher
- 五个哲学家的就餐问题，程序中有左撇子存在，不存在饿死的情况！-Five dining philosophers problem, procedures exist in the left-handed, there is no case of starvation!
eat
- 哲学家进餐问题，经典的同步问题，是初学者很好的学习材料-Dining philosophers problem, the classical synchronization problem is a very good learning materials for beginners
philosophereating
- 哲学家进餐问题,用C++编写,使用多线程实现,通过五个对话框模拟五个哲学家,很直观.-Dining philosophers problem, using C++ Preparation, the use of multi-threaded realize, through the five dialog simulation five philosophers, very intuitive.
eating
- 模拟哲学家进餐的同步问题，实现一个既没有两邻座同时吃饭，又没有人饿死（永远拿不到一双筷子）的算法-Simulation of synchronous dining philosophers problem, the realization of a neighbor at the same time do not have two meals, and no one starved to death (never get a pair
philosopher
- 哲学家就餐问题，一共七个哲学家，无限循环。结束进程才能停止程序-Dining philosophers problem, a total of seven philosophers, infinite loop. The end of the process in order to stop the procedure
zhexuejia
- linux用多线程同步方法解决哲学家就餐问题(Dining-Philosophers Problem)-linux using multi-thread synchronization methods to solve the problem dining philosophers (Dining-Philosophers Problem)
dining
- 哲学家就餐问题C语言演示程序，带窗口、对话框，有详细中英文注释-Dining philosophers problem of C language demo program with a window, dialog box, there are detailed notes in English and Chinese
dpfinal
- Dining philospher problem using semaphores
exp4
- 哲学家就餐问题C语言模拟，pthread库实现-The Dining Philosophers Problem C language simulation, pthread library implementation
phenosophy
- 本程序是在Linux下面 实现了哲学家就餐问题。其中演示了会发生死锁和不会发生死锁的情况。-This program is implemented in the Linux following the Dining Philosophers Problem. Which demonstrates the deadlock and does not happen will happen deadlock situation.
DiningPhilosopherProject
- Dining Philosopher problem solved, with graphical display for easy understanding.
dining-philo5
- example of dining philosopher problem. Five philopopher take part to eat, think and do nothing. explain using deadlock.
DINING
- 网络编程代码，网络编程中能用到的例子--哲学家进餐问题-Network programming code, network programming can be used to the example- dining philosophers problem
Dining-philosophers-problem
- 哲学家就餐问题 实现5个哲学家5支筷子的就餐问题涉及到AND型信号量，线程的阻塞唤醒切换功能-Dining philosophers problem to achieve five dining philosophers five chopsticks issues related to the AND-type semaphore, blocking thread switching wake