搜索资源列表
哲学家就餐问题的C#实现
- 哲学家就餐问题的C#实现 -dining philosophers problem of C#
哲学家就餐问题
- 哲学家就餐问题源代码-dining philosophers problem source code
多线称关于哲学家就餐问题
- 这是个操作系统中,多线称关于哲学家就餐问题的演示程序!-This is the demo program for the multithread about philosophers having dinner problem in the operating system!
哲学家就餐问题c语言实现
- c语言实现的哲学家就餐问题
JAVA解决哲学家就餐问题
- 用JAVA语言解决操作系统中哲学家就餐问题，解死锁问题
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
ipc
- ipc通信，哲学家就餐问题 采用信号量控制-ipc communications, dining philosophers problem using semaphores control
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
ph2
- 哲学家就餐问题的两种算法实现-Two philosophers eat algorithm
philosopheDining
- 死锁--哲学家就餐问题.完整源码,并可直接运行.-Deadlock- dining philosophers problem. Complete source code can be run directly.
dining
- 哲学家就餐问题C语言演示程序，带窗口、对话框，有详细中英文注释-Dining philosophers problem of C language demo program with a window, dialog box, there are detailed notes in English and Chinese
ConsoleApplicationforEat0207
- 操作系统中的哲学家就餐问题模拟系统。命令行程序。c#实现。运行需要.NET Framework 2.0。另有可视化界面程序。-Operating system in the dining philosophers problem simulation system. Command-line program. c# implementation. Required to run. NET Framework 2.0. Another visualization interface procedu
Dining_philosophers
- 用VC实现的哲学家就餐问题，其中用到了信号量的宏，并多线程的方法，模拟哲学家就餐问题。-Implementation using VC dining philosophers problem, use one of the semaphore macros, and multi-threaded approach, Analog dining philosophers problem.
frfs
- 读者写者问题，哲学家就餐问题，先来先来先服务-Writing questions from readers, dining philosophers problem, first-come, first-come, first serve
zhexuejiawenti
- 哲学家就餐问题 进程管理 -Dining philosophers problem of process management
Philosophers
- 哲学家就餐问题，他们每个人的左边都有一支筷子，解决死锁问题-Dining philosophers problem, the left side of each of them has a chopsticks, solve the deadlock problem
Dining_Philosophers_problem
- 是操作系统中的哲学家就餐问题的一个完整的示例源代码，可以在VC++6.0中完美编译运行。-The operating system in the Dining Philosophers problem of a complete sample source code in VC++6.0 can be compiled to run perfectly.