搜索资源列表
bankerand-philosopher
- 模拟银行家算法解决哲学家问题的小程序,程序能正确运行完不会造成死锁。-Analog bankers algorithm to solve the problem of small philosopher, the program runs correctly completed without causing deadlock.
ucos
- 基于ucos的哲学家就餐问题的解决方法,ucos操作系统初学者很好的例程-ucos os
root.tar
- 有五个哲学家围坐在一圆桌旁,桌中央有一盘通心粉,每人面前有一只空盘子,每两人之间放一只筷子每个哲学家的行为是思考,感到饥饿,然后吃通心粉.为了吃通心粉,每个哲学家必须拿到两只筷子,并且每个人只能直接从自己的左边或右边去取筷子-There are five philosophers sitting around a round table, table center with a plate of pasta, there is an e
unix_c_Thread
- UNIC-C 线程同步问题。 五个哲学家围坐在一张圆桌周围,每个哲学家面前都有一盘 通心粉。由于通心粉很滑,所以需要两把叉子才能夹住。相 邻两个盘子之间放有一把叉子。哲学家的生活中有两种交替 活动时段:即吃饭和思考。当一个哲学家觉得饿了时,他就 试图分两次去取其左边和右边的叉子,每次拿一把,但不分 次序。如果成功地得到了两把叉子,就开始吃饭,吃完后放 下叉子继续思考。-UNIC-C thread synchr
1.c
- Pthread 解决哲学家问题,Linux环境,C语言实现
1.c
- OpenMP 解决哲学家问题,linux环境,c语言实现-OpenMP philosophers problem solving, linux environment, c language
philosophers
- 用VC编程创建五个线程,模拟实现五个哲学家来竞争五只筷子(资源)去吃通心面的情况,必须确保五个线程的同步和互斥,并且在运行时不会产生死锁。-Creates five threads with VC programming, simulation five philosophers to compete for the five chopsticks (resources) to eat macaroni, must ensure tha
4
- 哲学家问题, 自己写的,很好用,用线程写的-Philosophy and problem
dining-philosophers-varellow
- 哲学家就餐问题算法仿真,使用windows下多线程编程-Dining philosophers problem algorithm simulation
zxj2.c.tar
- 哲学家吃饭算法的实现,用于解决线程产生死锁,并可以通过设定哲学家需吃饭时间判断算法效率-Philosophers eat algorithm, used to solve the thread deadlock, and can be set to determine the philosopher efficiency of the algorithm requires time to eat
pilossiphy
- 嵌入式实时操作系统,基于ucOS2实现的哲学家问题,-Embedded real-time operating system, based on philosophers problem ucOS2 achieve,
os
- linix哲学家问题,利用互斥信号量解决死锁。-linix philosophers problem, use mutex resolve the deadlock.
opera1
- 基于C++哲学家就餐问题,五位哲学家,五支筷子。-Based C++ dining philosophers problem, five philosophers and five chopsticks.
Dining-Philosophers
- 关于哲学家进餐的问题,运用了mfc,有动态演示效果-About the Dining Philosophers problem, the use of mfc, dynamic demonstration effect。。
shiyan2
- 哲学家进餐问题 #include<stdio.h> #include<semaphore.h> #include<pthread.h> //宏定义信号量个数为5,宏定义0表示思考,宏定义1表示饿,宏定义2表示吃,宏定义(ph_num+4) N表示左,宏定义(ph_num+1) N表示右 #define N 5 #define THINKING 0 #define H
Philosophy_Disp
- uc/os 哲学家就餐问题 五个哲学家共用五只筷子,怎样避免饥饿-uc/os Philosophy Disp
dining-philosopher-problem.c
- 操作系统中关于冲突的哲学家就餐问题的简单实现-Simple implementation of the operating system on the dining philosophers problem of conflict
201111212003522588
- 庄子是我国先秦(战国)时期伟大的思想家、哲学家、和文学家。原系楚国公族,楚庄王后裔,后因乱迁至宋国蒙,是道家学说的主要创始人。-Zi is the Qin (Warring States) period of the great thinker, philosopher and writer. Formerly 楚国公 family Zhuangwang descendants moved due to the chaos Song M
src
- 研究死锁时的经典案例,哲学家进餐,这里有五个不同的实现(因为在对这个问题的研究过程中前人提出了很多的思路),这里实现了最经典常见的五种-The Case Study of deadlock, the Dining Philosophers, here are five different implementations (as in the study of this issue in the previous made a lot o
CPPzhexuejia
- 这是采用C++的语言编写的程序,实现哲学家进餐问题的解决的方法-This is the use of written procedures C++ achieve settlement method Dining Philosophers Problem