搜索资源列表
-
0下载：
哲学家进餐问题是荷兰学者Dijkstra 提出的经典问题之一,它是一个信号量机制问题的应用,在操作系统文化史上具有非常重要的地位。对该问题的剖析有助于学生深刻地理解计算机系统中的资源共享、进程同步、死锁等问题,并能熟练地应用信号量来解决生活中的控制流程,即将生活中的控制流程用形式化的方式表达出来。-Dining philosophers problem is that the Dutch scholars Dijkstra classic one of the issues raised, it
-
-
0下载：
哲学家就餐问题MFC演示程序，生动说明了这个问题-Dining philosophers problem MFC demo program
-
-
0下载：
操作系统中经典的哲学家进餐问题，使用VC6.0可以进行编译-Operating system in the classic dining philosophers problem, use the VC6.0 compiler can
-
-
0下载：
六个哲学家就餐问题,体验进程(线程)和死锁的问题.本实验设计个哲学家共享一个相同的线程,既完成线程同步,又预防死锁发生.-6 dining philosophers problem, experience the process (thread) and deadlock issues. The experimental design a philosopher share a similar thread, both complete thread synchronization, but a
-
-
0下载：
利用多线程技术实现生产者－消费者问题以及n个哲学家就餐问题，其中生产者或消费者或哲学家用不同线程实现-Using multi-threading technology producer- consumer issues and the n-dining philosophers problem, in which the producer or consumer or a philosopher to achieve a different thread
-
-
0下载：
example of dining philosopher problem. Five philopopher take part to eat, think and do nothing. explain using deadlock.
-
-
0下载：
简单的哲学家进餐问题解决方案，使用互斥线程-Simple solutions to dining philosophers problem, using mutually exclusive threads
-
-
0下载：
使用多线程来解决哲学家就餐问题的源代-To use multiple threads to solve the source code for the dining philosophers problem
-
-
0下载：
In this article I will discuss deadlocks, what they are and how they can be avoided. I will also provide a sample implementation of how to detect when a deadlock occurs in a .NET application. The article uses the Dining Philosopher problem as a basis
-
