搜索资源列表
philsophy
- 哲学家就餐问题例子-dining philosophers problem example
哲学家就餐问题分析
- 该问题与以前经典的五个哲学家五根筷子不同，这次是每个哲学家身边均有一副刀叉，总的资源是充足的-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
zhexuejia
- 哲学家进餐问题实现-dining philosophers problem of achieving
philosphi
- 操作系统线程哲学家就餐算法原代码-operating system threads the dining philosophers algorithm source code
乳猪
- 一个多线程同步问题. 哲学家进餐问题!! java实现-a multithreaded synchronization. Dining Philosophers problem! ! Java Implementation
Rousseau1
- 五个哲学家，它们的生活方式是交替地进行思考和进餐。哲学家们共用一张圆桌，分别坐在周围的五张椅子上。在圆桌上有五个碗和五支筷子，平时一个哲学家进行思考，饥饿时便试图取用左、右最靠近他的筷子，只有在他拿到两支筷子时才能进餐，进餐毕，放下筷子又继续思考。-five philosophers, their lify style is alternately thinking and eating. philosophers share comm
经典同步问题：5哲学家进餐
- 经典同步问题中的哲学家进餐问题（材料：哲学家5个，筷子5只。要求：每个哲学家必须取得2只筷子时才能进餐，进餐完放下筷子，不能有哲学家饿死。ps：各哲学家每个状态时间有随机性）-Classic synchronous problem :five philosophers have dinner(material:5 philosophers ,five chopsticks.Demand: Each philosophers must h
模拟哲学家进餐
- 该程序是针对操作系统课程而做的模拟哲学家进餐问题-the program is to the operating system and programs do simulated dining philosophers problem
PhilosopherDining
- windowsAPI编程实现哲学家用餐问题。 五个哲学家五个线程。监测死锁并解决-windowsAPI Programming dining philosophers problem. 5 philosopher five threads. Monitoring and addressing Deadlock
eat1
- 使用线程实现并发操作，解决操作系统中经典的哲学家吃饭问题，通过可视化演示。-use threads to achieve concurrent operation and solve operating system classic philosophers food, through visual demonstration.
jiucan
- 哲学家就餐问题，本人已经在网上找了很久啦，希望能和大家分享-dining philosophers problem, I have to find on the Internet-- for a long time, and we hope to share
fivephilosopher
- 假如所有的哲学家都同时拿起左侧叉子，看到右侧叉子不可用，又都放下左侧叉子，等一会儿，又同时拿起左侧叉子，如此这般，永远重复。对于这种情况，即所有的程序都在无限期地运行，但是都无法取得任何进展，即出现饥饿，所有哲学家都吃不上饭。所以规定奇数号的哲学家先拿起他左边的叉子,然后再去拿他右边的叉子 而偶数号的哲学家则相反.按此规定,将是0,1号哲学家竞争0号叉子,2,3号哲学家竞争2号叉子.即五个哲学家都竞争奇数号叉子,获得后,再去竞争偶数号叉
threadphilosopher
- 利用线程方案实现实现哲学家问题.设置五个信号量代表五把叉子，初使值均为1，表示5把叉子均可以取，设置五个线程代表5个哲学家，其值分别为0～4，规定奇数号的哲学家先拿起他左边的叉子,然后再去拿他右边的叉子 而偶数号的哲学家则相反.按此规定,将是1,2号哲学家竞争1号叉子,3,4号哲学家竞争3号叉子.即五个哲学家都竞争奇数号叉子,获得后,再去竞争偶数号叉子,最后总会有一个哲学家能获得两支叉子而进餐。而申请不到的哲学家进入阻塞等待队列，根FI
task3
- ucosii小实验任务3 哲学家就餐，可以帮助学习嵌入式操作系统-ucosii small experimental task three dining philosophers can help embedded operating system
philosophers05
- 经典进程同步和互斥另类WINDOWS解法.定义信号量机制在WINDOWS下完成哲学家进餐问题.-classical process synchronization and mutex WINDOWS alternative solution. Volume definition signal mechanism in Windows complete the dining philosophers problem.
dinning
- 哲学家进餐的问题，用程序模拟实现，解释死锁的产生、解除以及预防-dining philosophers problem, simulation procedures, explained Deadlock in lifting and prevention
VxWorksprogramme
- 摘 要:通过一个经典的多任务同步哲学家进餐问题。介绍了Vxworks下的多任务程序设计和任务间通信机制，并给出了运行的结果 -Abstract : Through a classic multi-task synchronization dining philosophers problem. Vxworks introduced under the multi-task design and process communicati
emluatorofphilosopherdine
- 计算机仿真的实验，用三种方法模拟了哲学家进餐的过程，图形化的显示过程，用VC++.net开发的-computer simulation experiments, using three methods to simulate the process of the Dining Philosophers, graphical display process, VC. net development
process_tongbu
- 用win32函数，模拟了哲学家进餐问题，对于初学多线程编程的理解线程之间的同步和死锁问题很有启发性。-using win32 function to simulate the Dining Philosophers, For novice multithreaded programming understanding thread synchronization between the deadlock and very instruc
NachOS-4.1_110
- 美国加州大学操作系统课程实验平台Nachos，在美国非常流行，国内很多大学也采用。-the University of California courses on operating system platform Nachos, very popular in the United States, Many universities have adopted.