搜索资源列表
zhe4
- 哲学家进餐问题，用于观察进程之间互斥问题，知道进程之间关系-Petri Net Model to Solve the Dining Philosophers Problem and Implementation
eating
- 哲学家进餐问题，在各种编程语言中都会遇到，尤其是在WinForm编程中.-Dining philosophers problem, in a variety of programming languages ??are encountered, especially in the WinForm programming.
DINING
- 网络编程代码，网络编程中能用到的例子--哲学家进餐问题-Network programming code, network programming can be used to the example- dining philosophers problem
dining
- 哲学家进餐代码 附加可执行文件 哲学家进餐代码 附加可执行文件-Dining philosophers code attached executable file attached executable code dining philosophers
java
- 实现哲学家进餐问题，一共有五位哲学家在思考或者进餐，解决进程同步的问题-Dining philosophers problem to achieve
dining
- 说明:本程序是操作系统中比较典型的线程同步算法中的哲学家进餐问题,为防止死锁,采取了两个条件(筷子空闲)同时满足时再允许进餐的办法来解决。-Note: This procedure is typical of the operating system thread synchronization algorithm dining philosophers problem, in order to prevent deadlock, has taken two conditions (free c
Philosopher
- 进程（线程）同步及死锁--哲学家进餐问题-Philosopher problem
chengxu
- 进程互斥进程同步 哲学家有N个，也定全体到达后开始讨论：在讨论的间隙哲学家进餐，每人进餐时都需使用刀、叉各一把，所有哲学家刀和叉都拿到后才能进餐。哲学家的人数、餐桌上的布置自行设定，实现刀和叉的互斥使用算法的程序实现。-The philosopher N, also all arrived to begin to discuss: in the discussion of the gap the dining philosophers, each table needs to use kni
xitong
- 通过实现哲学家进餐问题的同步深入了解和掌握进程同步和互斥的原理哲学家有N个，也定全体到达后开始讨论：在讨论的间隙哲学家进餐，每人进餐时都需使用刀、叉各一把，所有哲学家刀和叉都拿到后才能进餐。哲学家的人数、餐桌上的布置自行设定，实现刀和叉的互斥使用算法的程序实现。-Philosophers have N, is also scheduled to discuss after all reach: the gap in the discussion of dining philosophers, e
Philosopher-dine
- 简单的哲学家进餐问题解决方案，使用互斥线程-Simple solutions to dining philosophers problem, using mutually exclusive threads
[java]philosophers-eating
- 本java设计模拟经典的哲学家进餐的同步问题，实现一个既没有两邻座同时吃饭，又没有人饿死（永远拿不到一双筷子）的算法。内附运行说明。-The Java design simulation of the classic dining philosophers synchronization issues, to achieve a two sitting next to him to eat, and no one starved to death (never get a pair of cho
zhexuejiajiucan
- 这是操作系统这门可的作业---哲学家进餐问题，用vc6.0编的，语言是c，可以说是windows程序设计吧-This is the operating system is working- the dining philosophers problem, with vc6.0 compiled language is c, can be said that the windows programming
zhexuejiawenti
- 对哲学家进餐问题可设置有五位哲学家，可以设置初始的状态，根据需要输入某一位哲学家拿起相应的筷子，由系统判断是否可以进餐-the man eat or put down kuaizi
multiThread
- Java多线程基本使用与若干典型实例（如哲学家进餐、生产者消费者问题）-Java MultiThread example application code,include some famous issue like Philosophcian eatting,Producter and Consumer
Event
- 基于Visual Studio 2008 编写的一个哲学家进餐问题，事件对象。-Event，MultiThread in Visual Studio 2008
philosophers
- 通过实现哲学家进餐问题的同步深入了解和掌握进程同步和互斥的原理-Through the dining philosophers problem of synchronization-depth understanding and mastery of process synchronization and mutual exclusion principle
Dzhexuejiai
- 哲学家进餐问题，实现多进程间的互互斥访问，进程间的竞争可直接使用。 -The dining philosophers problem, to achieve the mutual exclusive access to the multi-process, the competition between processes can be used directly.
philosophers
- 哲学家进餐例子。 哲学家问题的大意是：5个哲学家围坐在一张圆桌周围，每个哲学家面 前有一碟通心面,要使用筷子才能进餐。相邻两个碟子之间有一根筷子。哲 学家包含三种状态：吃饭、思考和挨饿。当一个哲学家觉得饿时，他才试 图分两次去取他左边和右边的筷子就餐，吃完以后放下筷子继续思考。-The dining philosophers example. Philosophers problem to the effect that: five philosophers sitting arou
Dphilosopheri
- 哲学家进餐问题是荷兰学者Dijkstra 提出的经典问题之一,它是一个信号量机制问题的应用,在操作系统文化史上具有非常重要的地位。对该问题的剖析有助助于学生深刻地理解计算机系统中的资源共享、进程同步、死锁等问题,并能熟练地应用信号量来解决生活中的控制流程,即将生活中的控制流程用形式化的方式表达出来。 -The dining philosophers problem is one of the Dutch scholar Dijkstra' s classic, it is the ap
Multitasking_Programming_On_VxWorks
- 通过一个经典的多任务同步哲学家进餐问题。介绍了VxWorks 下的多任务程序 设计和任务间通信机制，并给出了运行的结果。-Multi-task synchronization through a classic dining philosophers problem. Under VxWorks multitasking programming and inter-task communication mechanisms, and the results of the run.