搜索资源列表
diningphilosopher
- 哲学家就餐问题算法实现-Algorithm dining philosophers problem
philsophy
- 哲学家就餐问题例子-dining philosophers problem example
zxjjc
- 计算机仿真的实验，用三种方法模拟了哲学家进餐的过程，图形化的显示过程，用VC++.net开发的-computer simulation experiments, using three methods to simulate the process of the Dining Philosophers, graphical display of the process, with VC. Net development
哲学家进餐问题仿真
- 哲学家进餐问题仿真-dining philosophers problem Simulation
eat
- 哲学家进餐问题Java版-dining philosophers problem Java version
哲学家进餐问题VC版
- 本程序是操作系统中比较典型的线程同步算法中的哲学家进餐问题,为防止死锁,采取了两个条件(筷子空闲)同时满足时再允许进餐的办法来解决。期望与大家一起学习交流!-the procedure is fairly typical operating system threads synchronization algorithm of the Dining Philosophers, in order to prevent deadlock a
PhilospherDining
- 它是一个经典的算法－哲学家进餐问题，用VC＋＋实现，通过它大家可以掌握Windows中的多线程编程-It is a classic algorithm-the Dining Philosophers, VC++, through which we can grasp the Windows multi-threaded programming
哲学家进餐问题仿真
- vc++演示操作系统哲学家进餐问题，非常好用-vc operating system demonstration dining philosopher, a very handy
200511121433511933
- 很好用 OS的一个很好用的东西 很值得大家看看 哲学家就餐问题的很好的实现-good with a good OS, the things you look at the merits of the Dining Philosophers achieve good
chip（单片机源程序）
- 好东西 关于单片机的一些重要的代码本程序是操作系统中比较典型的线程同步算法中的哲学家进餐问题,为防止死锁,采取了两个条件(筷子空闲)同时满足时再允许进餐的办法来解决。期望与大家一起学习交流!-good things on SCM some important source of this procedure is more typical operating system threads simultaneously count the
jiucan
- 哲学家就餐问题，本人已经在网上找了很久啦，希望能和大家分享-dining philosophers problem, I have to find on the Internet-- for a long time, and we hope to share
p_eating
- 本程序是模拟哲学家进餐这个经典的操作系统的问题-the simulation procedure is the classic philosophers dining operating system problems
zhexuejiajincan
- 计算机操作系统原理与实现中的重要实验，关于哲学家进餐的问题-computer operating system Theory and the important experiments on the dining philosophers problem
zhexue05
- 进程同步,哲学家进餐共享临界区变量.定义信号量机制控制进程不互斥!-process synchronization, philosopher dining area share critical variables. Definition signal to the process control mechanism not contradict!
lunch
- 哲学家进餐问题 在多线程中如何避免死锁。 问题描述：有五位哲学家围绕着餐桌坐，每一位哲学家要么思考 要么等待，要么吃饭。为了吃饭，哲学家必须拿起两双筷子（分 别放于左右两端）不幸的是，筷子的数量和哲学家相等，所以每 只筷子必须由两位哲学家共享-dining philosophers problem in multithreaded how to avoid deadlock. Problem descr ipt
DINING
- 演示哲学家就餐 进程的同步与互斥-Demo dining philosophers process synchronization and mutual exclusion
ucos-dining-philosopher
- ucos-dining-philosopher.rar ucos下的哲学家就餐问题（dining philosopher problems)，采用信号量机制解决，有截图和感悟。dos界面文字演示（另有图形界面）。-ucos-dining-philosopher.rarucos under the dining philosophers problem (dining philosopher problems), using sema
Dining
- 程序源代码： /* Item The Dining Philosophers Problem 具体要求 1) 5个哲学家，先吃饭，后思考。 2) 每个哲学家都需要吃9顿饭，思考9次，然后结束。 3）吃饭时间为3~12秒的随机时间 4）思考时间为7~19秒的随机时间 5）对取叉子和放叉子等临界资源的操作前后需要输出相关状态信息，包括哲学家的各种状态信息。要有足
dining
- 哲学家进餐代码 附加可执行文件 哲学家进餐代码 附加可执行文件-Dining philosophers code attached executable file attached executable code dining philosophers
dining
- c program for dining philosopher problem