搜索资源列表
maicunguanli
- 解决软件开发中常见的哲学家就餐问题，很好用的程序，希望对你有开发有帮助,UCOS下开发的。-To solve common software development dining philosophers problem, a good use of the program, want to help you develop, UCOS under development.
DiningPhilosophers
- 六个哲学家就餐问题,体验进程(线程)和死锁的问题.本实验设计个哲学家共享一个相同的线程,既完成线程同步,又预防死锁发生.-6 dining philosophers problem, experience the process (thread) and deadlock issues. The experimental design a philosopher share a similar thread, both complete thread synchronization, but a
ucos_Philosopher_Repast
- uC/OS哲学家就餐演示.这个程序演示基本的哲学家就餐问题的解决。程序启动具有五个不同优先级的任务，每个任务对应一个 * 哲学家，完成一系列动作.-uC/OS Dining Philosophers presentation. This program demonstrates the basic dining philosophers problem to solve. Program starts with five different priority tasks, each tas
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 different thread
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 programs for reference ~
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 synchronization producers and consumers,
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
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.
DineRun
- JAVA多线实现哲学家就餐问题-JAVA multi-line to achieve the dining philosophers problem
1
- 经典的操作系统 哲学家就餐问题-dining philosophers problem
Philosophy_Eating
- 仿真操作系统经典的哲学家就餐问题。采用Visual C++及mfc编程实现。-A system of Philosophy-Eating Problem.
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