搜索资源列表
eat
- 哲学家进餐问题，经典的同步问题，是初学者很好的学习材料-Dining philosophers problem, the classical synchronization problem is a very good learning materials for beginners
uC_OS-II
- uC_OS-II内核实验指导书和实验程序，是我们做uC_OS-II内核实验时的资料，实验程序有：内存管理、任务管理、时钟中断、消息队列、优先级反转、优先级继承、哲学家就餐等。-uC_OS-II core experiments and experimental procedures for the guidance of the book is that we make uC_OS-II core experiment data, ex
eat
- 用c语言实现了操作系统中的哲学家就餐问题,可以参考-C language used in the operating system to achieve the dining philosophers problem, can refer to
philosophereating
- 哲学家进餐问题,用C++编写,使用多线程实现,通过五个对话框模拟五个哲学家,很直观.-Dining philosophers problem, using C++ Preparation, the use of multi-threaded realize, through the five dialog simulation five philosophers, very intuitive.
DINING
- 演示哲学家就餐 进程的同步与互斥-Demo dining philosophers process synchronization and mutual exclusion
thread
- 利用JAVA实现了多线程编程,解决哲学家就餐问题-JAVA achieved using multi-threaded programming, solve the dining philosophers problem
4
- 在linux下实现编制模拟“五个哲学家”问题的程序-In the preparation of simulation under linux
5
- 在unix下实验五，五个哲学家的问题以及一些相关的内容-In the experiment under unix five, five philosophers, as well as some relevant content
eating
- 操作系统中关于哲学家进餐问题的演示，哲学家左右两边的筷子，分别用一个变量表示，这是一个很经典的问题。该程序在VC环境下运行。-Operating system on the dining philosophers problem presentation, philosophers on both sides of the chopsticks, were used to express a variable, this is a ve
philosopher(1.6)
- 哲学家进餐问题——Java语言实现 哲学家进餐问题是一个多线程运用的经典例子，涉及到线程同步/互斥，临界区访问问题以及一个避免死锁的解决方法。 有五个哲学家绕着圆桌坐，每个哲学家面前有一盘面，两人之间有一支筷子，这样每个哲学家左右各有一支筷子。 哲学家有2个状态，思考或者拿起筷子吃饭。如果哲学家拿到一只筷子，不能吃饭，直到拿到2只才能吃饭，并且一次只能拿起身边的一支筷子。一旦拿起便不会放下筷子直到把饭吃完，此时才把这
JAVA
- 这是哲学家问题算法，它能够自动地实现。希望大家好好使用-This is the philosopher, the issue of algorithm, it can automatically realize. Hope that we make good use of
eating
- 模拟哲学家进餐的同步问题，实现一个既没有两邻座同时吃饭，又没有人饿死（永远拿不到一双筷子）的算法-Simulation of synchronous dining philosophers problem, the realization of a neighbor at the same time do not have two meals, and no one starved to death (never get a pair
DiningPhilosophor1
- 哲学家进餐问题，课程设计，界面友好，实现功能很好。模拟了同步互斥-Dining philosophers problem, curriculum design, friendly interface and good functionality realize. Simulation of synchronous mutex
philosophy-five-jcsp
- 升级版本，五个哲学家问题,用jcsp 实现。-Upgraded version of the five philosophers problem, with jcsp realize.
zhexuejia
- linux用多线程同步方法解决哲学家就餐问题(Dining-Philosophers Problem)-linux using multi-thread synchronization methods to solve the problem dining philosophers (Dining-Philosophers Problem)
philosopher
- 经典的哲学家就餐问题的C语言版本-Power wilt die of hunger laugh mold cavity open string问Questions cavity C Pang Sung-linked版
ucos-dining-philosopher
- ucos-dining-philosopher.rar ucos下的哲学家就餐问题（dining philosopher problems)，采用信号量机制解决，有截图和感悟。dos界面文字演示（另有图形界面）。-ucos-dining-philosopher.rarucos under the dining philosophers problem (dining philosopher problems), using sema
java_threaddemo
- 哲学家就餐是一个经典的Java多线程编程的实例，这是图形版。涉及到线程同步与互斥，临界区访问问题以及避免死锁的方法。 -Dining philosophers is a classic multi-threaded Java programming examples, this is the graphics version. Related to thread synchronization and mutual exclusion,
philosopheDining
- 死锁--哲学家就餐问题.完整源码,并可直接运行.-Deadlock- dining philosophers problem. Complete source code can be run directly.
dining_philosopher.tar
- 哲学家进餐经典算法的pthread多线程实现代码-Classic dining philosophers pthread algorithm to achieve multi-threaded code