搜索资源列表
Fixed_Dining_Philosophers
- 英国帝国理工学院电脑系多线程课程教学材料之九 ---- 哲学家晚餐范例（无死锁，需要引用到原问题的部分代码）-The version avoids the possibility of deadlock by making even numbered philosophers pick up the chopsticks in a different order from the rest. That is, left first rather than right first.
Philosopher
- 哲学家就餐问题MFC演示程序，生动说明了这个问题-Dining philosophers problem MFC demo program
philosopher_problem
- 哲学家问题，vxworks任务调试及处理的一种实现，原创。-vxworks,phisolopher problems.solution.
Philosopher
- 操作系统中经典的哲学家进餐问题，使用VC6.0可以进行编译-Operating system in the classic dining philosophers problem, use the VC6.0 compiler can
philosopher
- 基于UCOS2开源的程序，描述了操作系统里经典的哲学家就餐问题，很好的实现了进程的实时控制，实现了进程同步 -UCOS2 procedures based on open source, describes the operating system in the classic dining philosophers problem, a very good implementation of the process of real-time control, implementation of
DineRun
- 哲学家吃饭问题 当五个人都拿到左手边筷子，都等待拿右手边筷子，则因为谁都不能放下手中的筷子，这样就进入无止境的等待，构成死锁 * 解决方法1：奇数号先拿左边的筷子，偶数号先拿右边的筷子,即相邻两个人先拿其中间夹的筷子，使这个筷子成为临界资源； * 解决方法2：两边的筷子都空闲时，再拿筷子，if(chopstick.flag(n)==false&&chopstick.flag(n 5)==false)； * 解决方法3：只允许(n-1)个人同时进餐； * 本程序采用方
4
- unix下实现5个哲学家之间的取食和思考的问题的一个实验-unix implementation of five between the philosopher and consider the problem of feeding an experimental
philosopher
- 模拟“五个哲学家”问题该实验的要点是，解决并发环境下，多进程之间的同步与互斥问题。进程间的同步互斥必然涉及进程间的通信（信息交换）。-Simulation of the " five philosophers" problem of the main points of the experiment, the solution to complicated circumstances, between the multi-process synchronization and
src
- 计算机操作系统中解决哲学家吃饭的问题的VC++实现。-Computer operating system to address the issue of eating philosophers of VC++ to achieve.
Eating
- 根据哲学家就餐算法实现的程序。主要是解决可能出现的死锁问题。-Dining philosophers algorithm in accordance with procedures. Mainly to resolve the deadlock issues that may arise.
DiningPhilosophor
- 模拟哲学家就餐的过程，通常是操作系统的课程设计的课题 -Dining philosophers process of simulation, the operating system is usually the subject of the curriculum design
LQZXJ
- 用c语言编写的哲学家算法模拟 很好很实用 可以方便初学者 掌握-With c language philosophers algorithm simulation is a good beginners can easily master the practical
dining
- 关于哲学家问题的实现。5个哲学家使用两只筷子，期间会发生死锁。-With regard to the question of the realization of the philosopher. Philosopher, the use of two 5 chopsticks, deadlock will occur during the period.
review
- 操作系统复习资料 包括用p，v原语实现读写优先 哲学家用餐问题-Review the information, including operating system with p, v the original language to read and write to achieve the priority dining philosophers problem
zhexue
- 通过研究Linux的线程机制和信号量实现哲学家就餐问题的并发控制-By studying the Linux thread and semaphore mechanisms to achieve dining philosophers problem of concurrency control
philosopher
- 操作系统课程设计，哲学家算法的模拟 程序简短-Philosopher of the simulation algorithm
SystemOs
- 用多线程同步方法解决哲学家就餐问题 操作系统课程设计 Dining-Philosophers Problem-Dining-Philosophers Problem
zhexuejia
- 哲学家进餐问题，实现多进程间的互斥访问，进程间的竞争-Dining Philosophers problem, to achieve mutually exclusive access among the multi-process, the process of competition between
aboutlunch
- 关于UC/OSII的应用，任务三哲学家就餐问题，对更深入理解操作系统基本原理非常有帮助-With regard to UC/OSII applications, tasks, three dining philosophers problem, more in-depth understanding of the basic principles of the operating system is very helpful
zhexuejia
- 一群哲学家的问题,就餐问题，请大家提提意见！谢谢各位了！-it is yiqun sdfs sad dsad df fa f af f afd g dg g