搜索资源列表
哲学家进餐问题仿真
- vc++演示操作系统哲学家进餐问题，非常好用-vc operating system demonstration dining philosopher, a very handy
哲学家问题
- 用java模拟哲学家就餐问题
JAVA解决哲学家就餐问题
- 用JAVA语言解决操作系统中哲学家就餐问题，解死锁问题
哲学家就餐问题
- 哲学家问题的C语言代码，有死锁和防止死锁两种方式可供选择
diningphilosopher.zip
- 哲学家就餐问题算法实现,Algorithm dining philosophers problem
PhilosopherDining.rar
- 在 WINDOWS 系统中实现哲学家就餐问题的死锁和不死锁两种解法。,WINDOWS system to achieve in the dining philosophers problem of deadlock and deadlock two solution.
philosopher(VC).rar
- 哲学家就餐问题（VC图形界面版，添加了暂停恢复演示功能）,philosopher eating demo
dining_philosopher.tar
- 哲学家进餐经典算法的pthread多线程实现代码-Classic dining philosophers pthread algorithm to achieve multi-threaded code
ipc
- ipc通信，哲学家就餐问题 采用信号量控制-ipc communications, dining philosophers problem using semaphores control
DineRun
- JAVA实现的哲学家进餐问题,5个哲学家,为着一个圆桌,相互之间放着一只筷子,当哲学家饿了的时候边可拿起,傍边的筷子进餐,完了在放下-Rousseau
java_threaddemo
- 哲学家就餐是一个经典的Java多线程编程的实例，这是图形版。涉及到线程同步与互斥，临界区访问问题以及避免死锁的方法。 -Dining philosophers is a classic multi-threaded Java programming examples, this is the graphics version. Related to thread synchronization and mutual exclusion, critical area to visit, as we
lab1
- 操作系统中的 哲学家进餐问题 经典算法vc版-Operating system in the dining philosophers problem
uCOS-II_on_VC
- VS2008 & VC++6.0 版本基于ucos-ii的哲学家就餐问题的解决方法-VS2008 & VC++6.0 version solution to the the Dining Philosophers problem based on ucos-ii
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 semaphore mechanism to resolve scr
EX3_x86L
- 哲学家就餐问题的模拟(ucos实现) 问题描述： 5个哲学家围绕一张圆桌而坐，桌子上放着5支筷子，每两个哲学家之间放一支； 哲学家的动作包括思考和进餐； 进餐时需要同时拿起他左边和右边的两支筷子；思考时则同时将两支筷子放回原处。 程序解决了哲学家的就餐问题。 避免死锁(deadlock) 避免饥饿(starvation) 程序使用的使用消息邮箱模拟二值信号量-philosopher eating problem
philosopher_java
- 这是Java图片版的哲学家就餐经典问题的实现，虽然界面简单，但是对于情况的模拟还是比较真实的。-This is a Java image version of the classic dining philosophers problem to achieve, although the interface simple, but for the simulation of the situation is quite true.
ph2
- 哲学家就餐问题的两种算法实现-Two philosophers eat algorithm
philosopheDining
- 死锁--哲学家就餐问题.完整源码,并可直接运行.-Deadlock- dining philosophers problem. Complete source code can be run directly.
food
- 哲学家进餐问题 操作系统的几大代码之一-Dining philosophers problem of operating system, one of several major code
dining
- 哲学家就餐问题C语言演示程序，带窗口、对话框，有详细中英文注释-Dining philosophers problem of C language demo program with a window, dialog box, there are detailed notes in English and Chinese