搜索资源列表
main
- 柔性机械制造系统死锁的防止方法仿真哲学家就餐问题的java程序研究 -Flexible Manufacturing Systems deadlock prevention method for simulation of the dining philosophers problem of java program
OS4
- 模拟哲学家就餐问题：设置5个子线程模拟5个哲学家，设置5个互斥区为筷子。输出各个哲学家的状态，如果在就餐，则同时输出他所使用的左右筷子序号。-Simulation of the dining philosophers problem: Set 5 5 sub-thread simulation philosopher, set five mutually exclusive area for chopsticks. The state of the output of each philosop
zxuejiajiucanwenti
- 哲学家就餐问题：很好解决死锁问题，是操作系统课程设计的一个范例-Dining philosophers problem: a good solution to the deadlock problem, the operating system is an example of curriculum design
ZEXUEJIAJIUCAN
- 嵌入式操作系统实验实验用例程序源代码：一个关于哲学家就餐的源程序。-English of UCOS.The program of ZEXUEJIAJIUCAN.
Dining-philosophers-problem
- 哲学家就餐问题 实现5个哲学家5支筷子的就餐问题涉及到AND型信号量，线程的阻塞唤醒切换功能-Dining philosophers problem to achieve five dining philosophers five chopsticks issues related to the AND-type semaphore, blocking thread switching wake
duodao
- 多道批处理系统 用于作业的进程调度 修改哲学家就餐问题-Multi-channel system for batch process scheduling jobs to modify the dining philosophers problem
duodao2
- 多道批处理系统 用于作业的进程调度 修改哲学家就餐问题-Multi-channel system for batch process scheduling jobs to modify the dining philosophers problem
txt
- 哲学家就餐问题，只允许四个人进入。不会造成死锁的解决方式。-This is a dining philohser
Dinning-philosophers
- 在linux下“哲学家就餐”问题的一种解法-a solution of "dining philosophers" problem under Linux
philosophy-dining
- 多线程解决哲学家就餐问题，实现进程与线程间的同步。-Multi-threading to solve the dining philosophers problem, to achieve synchronization between processes and threads.
DiningPhilosophersUI
- 哲学家就餐，用于解释计算机死锁问题，是关于操作系统的一个实验-The philosopher repast, used to explain the computer the dead lock question is about an operating system experiment
DineRun
- JAVA多线实现哲学家就餐问题-JAVA multi-line to achieve the dining philosophers problem
DiningPhilosophers
- C# 实现 操作系统经典问题哲学家就餐系统 winfrom版-winfrom eat
1
- 经典的操作系统 哲学家就餐问题-dining philosophers problem
Philosophy_Eating
- 仿真操作系统经典的哲学家就餐问题。采用Visual C++及mfc编程实现。-A system of Philosophy-Eating Problem.
PhilosopherProblem
- 编写P、V操作和信号量的模拟程序，然后用它们解决不死锁的哲学家就餐问题，并把哲学家们的活动过程用文字或可视化表示出来。-Write P, V operation and the amount of signal simulation program, and then use them to solve the undead philosophers of the lock repast questions and to the process of the philosophers in wo
bss
- 实现哲学家就餐问题Linux+C DiningPhilosophers-Linux C DiningPhilosophers DiningPhilosophers DiningPhilosophers
Philosopher-Dinner
- 哲学家就餐问题的仿真，仿真结果给出每个哲学家等待的平均时间。此外还有多种策略的对比，以评判策略的优劣。-Simulation of the philosophers s repast problem, the simulation gives the average time that philosopher has been waited for dinner. In addition there are a variety of strategies, then it can judge t
Philosoper
- 哲学家就餐问题java源码 实现死锁与不死锁的问题 -Philosoper dining java
dinning
- 此代码描述的是操作系统的经典哲学家就餐问题的C语言代码，可选择死锁或防止死锁两种模式，有图形模拟。-This code describes the C language code is the classic dining philosophers problem in the operating system can choose to deadlock or to prevent deadlock in two modes, and graphic simulation.