搜索资源列表
ucos_Philosopher_Repast
- uC/OS哲学家就餐演示.这个程序演示基本的哲学家就餐问题的解决。程序启动具有五个不同优先级的任务，每个任务对应一个 * 哲学家，完成一系列动作.-uC/OS Dining Philosophers presentation. This program demonstrates the basic dining philosophers problem to solve. Program starts with five diff
2008130283
- 设计解决哲学家就餐的并发线程，采用了3种预防死锁的方法（摒弃‘环路等待’条件，摒弃‘请求和保持’条件，摒弃‘不剥夺’条件），要预防死锁，只采用其中的任何一种方法即可。-Design of concurrent threads Dining Philosophers solution, using a 3 way deadlock prevention (discard ' Circle wait' conditions,
philosophersproblem
- 利用多线程技术实现生产者－消费者问题以及n个哲学家就餐问题，其中生产者或消费者或哲学家用不同线程实现-Using multi-threading technology producer- consumer issues and the n-dining philosophers problem, in which the producer or consumer or a philosopher to achieve a differe
123
- 哲学家就餐问题的解决方案，有详细的注释，线程兵法问题的解决-Dining Philosophers solution to the problem, detailed notes, problem solving thread art of war
OS
- 本学期操作系统的两次试验打包，银行家算法，PV操作中的哲学家就餐问题和生产者消费者问题，小程序仅供参考~-This semester, two tests of the operating system package, bankers algorithm, PV operation of the dining philosophers problem and producers of consumer issues, small pr
Philosopher
- 哲学家就餐问题 操作系统模拟实验解答，详细具体-Dining philosophers problem
thread
- 实验总体要求，使用MFC相关的功能函数来模拟经典进程互斥和同步问题 生产者和消费者 读者和写者 哲学家就餐问题-The general requirements of experiments, the use of MFC function to simulate the functions related to the classical problem of mutual exclusion and synchroniz
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
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
Stm32_ucos
- 在STM32上编写多任务实时操作系统，同时运行6个任务，通过发送和接收信号量机制，解决哲学家就餐问题，通过板上按键代表哲学家的就餐请求，板上LED灯表示就餐成功或者未果，同时在晶体数码管上显示就餐申请时间。-STM32 to write multi-task in real-time operating system, run six tasks by sending and receiving semaphore mechanism
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