搜索资源列表
PhilosopherDining
- windowsAPI编程实现哲学家用餐问题。 五个哲学家五个线程。监测死锁并解决-windowsAPI Programming dining philosophers problem. 5 philosopher five threads. Monitoring and addressing Deadlock
DINPHIL
- D:\\jh\\哲学家吃饭\\DINPHIL.rar哲学家吃饭-D : \\ jh \\ philosopher eat \\ DINPHIL.rar philosopher dinner
zhexuejiasuanfa
- 操作系统中的哲学家就餐算法 c语言编写-OS philosopher dine algorithm c language
DiningPhilosophor
- 一个哲学家就餐问题的MFC源码,有动画过程.-a philosopher and dine the MFC source code, animation process.
philosopher.c
- 哲学家问题的解决，对于并发程序以及多线程的一个简单的解决-philosopher solve the problem, and for the concurrent program in a multithreaded simple solution
philosopher
- 哲学家就餐问题，一共七个哲学家，无限循环。结束进程才能停止程序
哲学家进餐问题仿真
- vc++演示操作系统哲学家进餐问题，非常好用-vc operating system demonstration dining philosopher, a very handy
philosopher
- 操作系统课程设计，哲学家算法的模拟 程序简短-Philosopher of the simulation algorithm
dinning
- dinnig philosopher problem
philosopheralgorithm
- 利用vc++的各项相关功能和操作系统的相关知识完成哲学家算法~-Using vc++ with the relevant functions and knowledge of the operating system to complete the philosopher algorithm ~
Philosopher
- 哲学家就餐问题 操作系统模拟实验解答，详细具体-Dining philosophers problem
philosopher.tar
- 用C语言实现了经典的哲学家吃饭问题。使用了信号量机制。-Dinning philosopher s problem implemented in C
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
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
zhexuejiajiucanwenti
- 一群哲学家围坐在一个圆桌，手上持有密码m，并从1开始编了号取初值m，哲学家从1开始报数, 报到m的哲学家停止吃饭，退出圆桌，求哲学家退出的顺序。要求:n和初值m由完家输入.手上的密码随机产生.最后要打印出编号对应的密码，输出哲学家离开的相后顺序-philosopher，philosopher away from cookdesk in the follow queue
philosopher
- 哲学家就餐问题，有左撇子，至少使用信号量、消息通信、管程三种方式之中的一种模拟哲学家就餐问题。 用一个输入变量控制是否有左撇子哲学家。如果有，其数量由随机数生成。 模拟程序分为两种情况， 可能发生死锁的情况，输出发生死锁时的资源分配状态和历史资源分配状态； 设计没有死锁发生的程序，当每个哲学家至少完成一次就餐后，输出资源分配给哲学家的当前状态和历史状态。 最好具备图形界面，动态显示哲学家就餐的过程。-Dining philosophers problem, a left-ha
zhexuejiajiucan
- 设计程序实现N只筷子的有效分配，使用的限制条件为仅当哲学家的左右两只筷子均可用时，才允许他拿起筷子进餐。-Design process to achieve efficient allocation of N only chopsticks, the use restrictions for the left and right only when the philosopher with two chopsticks are available only when allowed him to
Philosopher
- 通过哲学家就餐问题展示了三种不同的预防死锁的方法。-Shows three different deadlock prevention method through the dining philosophers problem.