搜索资源列表
200511121433511933
- 很好用 OS的一个很好用的东西 很值得大家看看 哲学家就餐问题的很好的实现-good with a good OS, the things you look at the merits of the Dining Philosophers achieve good
jiucan
- 哲学家就餐问题,本人已经在网上找了很久啦,希望能和大家分享-dining philosophers problem, I have to find on the Internet -- for a long time, and we hope to share
task3
- ucosii小实验任务3 哲学家就餐,可以帮助学习嵌入式操作系统-ucosii small experimental task three dining philosophers can help embedded operating system
zhexuejiasuanfa
- 操作系统中的哲学家就餐算法 c语言编写-OS philosopher dine algorithm c language
哲学家就餐问题分析
- 该问题与以前经典的五个哲学家五根筷子不同,这次是每个哲学家身边均有一副刀叉,总的资源是充足的-problems with the previous five classic philosophers five different chopsticks, this is the philosopher of each side have a knife and fork, the total resources are adequate
哲学家问题
- 用java模拟哲学家就餐问题
哲学家就餐问题
- 哲学家问题的C语言代码,有死锁和防止死锁两种方式可供选择
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
Philosophers
- 哲学家就餐问题,他们每个人的左边都有一支筷子,解决死锁问题-Dining philosophers problem, the left side of each of them has a chopsticks, solve the deadlock problem
java_threaddemo
- 哲学家就餐是一个经典的Java多线程编程的实例,这是图形版。涉及到线程同步与互斥,临界区访问问题以及避免死锁的方法。 -Dining Philosophers is a classic example of Java multi-threaded programming, it is graphic version. Related to thread synchronization and mutual exclusion, critical access issues and ways to
ppzhexuejia
- 这是一个具有动态图形界面的哲学家就餐程序,希望对大家有帮助-This is a graphical interface with dynamic dining philosophers program, we want to help
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.
ZxjFrame
- 哲学家就餐问题,图像化描述,可以让你能更加好的理解相关操作系统问题。-Dining philosophers problem, descr iption of the image, allowing you to more good understanding of the issues related to the operating system.
problem
- 哲学家就餐问题的解决,操作系统中线程与并发的问题-Solution to the dining philosophers problem
philpsopher
- 哲学家就餐问题的解决方法 运用java多线程模拟所有解决哲学家就餐问题的方法-Solution to the dining philosophers problem using multi-threaded simulation of java all the dining philosophers problem solving
philosophy
- 哲学家就餐问题,五个哲学家只有五只筷子,保证所有哲学家不饿死的情况下实现就餐问题!-about the philosopher‘s dinner
多线程调度——哲学家就餐
- 利用JAVA线程,解决哲学家就餐问题。当某一哲学家线程执行取得筷子方法时, 程序会根据该线程的名称来确定该线程需要使用哪两支筷子,并且分辨出哪支筷子编号是奇数,按照先奇后偶的顺序来试图取得这两支筷子。 如果这两支筷子都未被使用(即对应的数组元素值为 false),该哲学家线程即可先后取得这两支筷子进餐,否则会在竞争某支筷子失 败后执行 wait()操作进入 Chopsticks 类实例的等待区, 直到其他的哲学家线程进餐完毕放下筷子时用 notifyAll()将其唤醒。当某一哲学家线程放下筷子时