搜索资源列表
Philosopher（new）
- 这是一道经典的线程同步问题——哲学家吃饭问题。这里结合了win32使得这个问题可视化了-This is a classic thread synchronization -- philosopher food problem. Win32 here combination of this makes the issue of visualization
philosopher.c
- 哲学家问题的解决，对于并发程序以及多线程的一个简单的解决-philosopher solve the problem, and for the concurrent program in a multithreaded simple solution
philosopher(VC).rar
- 哲学家就餐问题（VC图形界面版，添加了暂停恢复演示功能）,philosopher eating demo
philosopher
- 采用c语言实现哲学家进餐问题，实现进程机制的管理！-Using c language implementation philosopher dine and realize process of management mechanism
ucos-dining-philosopher
- ucos-dining-philosopher.rar ucos下的哲学家就餐问题（dining philosopher problems)，采用信号量机制解决，有截图和感悟。dos界面文字演示（另有图形界面）。-ucos-dining-philosopher.rarucos under the dining philosophers problem (dining philosopher problems), using semaphore mechanism to resolve scr
philosopher
- 哲学家就餐问题的实现，进程死锁问题，PV原语-Philosophers eat the realization of the process of deadlock, PV primitives
philosopher
- 操作系统课程设计，哲学家算法的模拟 程序简短-Philosopher of the simulation algorithm
philosopher
- dinning philosopher problem
dinning
- dinnig philosopher problem
DiningPhilosopherProject
- Dining Philosopher problem solved, with graphical display for easy understanding.
Philosopher
- 哲学家问题。操作系统经典问题。非常好的资源，希望大家喜欢。-Philosophers problem. Classic problem of the operating system. Very good resources, I hope everyone likes.
philosopher.tar
- 用C语言实现了经典的哲学家吃饭问题。使用了信号量机制。-Dinning philosopher s problem implemented in C
Philosopher
- 进程（线程）同步及死锁--哲学家进餐问题-Philosopher problem
philosopher
- 操作系统作业，实现哲学家算法的死锁与非死锁，死锁的出现是随机的，此程序并不能保证一定会出现死锁-Realize the philosopher algorithm with the dead lock dead lock
Deadlock-philosopher
- 实现了不死锁的哲学家问题（进程同步互斥），有简单界面，有图。-Deadlock philosopher (process synchronization mutual exclusion), simple interface, there are plans.
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
dining-philosopher
- its a simple dining philosopher problem. the issue is a famous process synchronisation problem solved through c programming.
Philosopher
- 哲学家就餐问题在windows下的实现。动态打印哲学家进程的状态（就餐、等待、思考）-The dining philosophers problem under windows. The state of the process of dynamic print philosopher (eating, waiting, thinking)
philosopher
- 哲学家就餐问题，有左撇子，至少使用信号量、消息通信、管程三种方式之中的一种模拟哲学家就餐问题。 用一个输入变量控制是否有左撇子哲学家。如果有，其数量由随机数生成。 模拟程序分为两种情况， 可能发生死锁的情况，输出发生死锁时的资源分配状态和历史资源分配状态； 设计没有死锁发生的程序，当每个哲学家至少完成一次就餐后，输出资源分配给哲学家的当前状态和历史状态。 最好具备图形界面，动态显示哲学家就餐的过程。-Dining philosophers problem, a left-ha
bankerand-philosopher
- 模拟银行家算法解决哲学家问题的小程序，程序能正确运行完不会造成死锁。-Analog bankers algorithm to solve the problem of small philosopher, the program runs correctly completed without causing deadlock.