搜索资源列表
桌面
- 改进的哲学家问题,用信号和共享内存实现- The improvement philosopher question, realizes with the signal and the sharing memory
zxj
- 这是嵌入式系统中关于哲学家吃饭问题的源程序,解压无需密码-This is the embedded system on the philosopher food source, without extracting passwords
Wangmeng_3281411350
- 哲学家问题演示 不会哦,副教授法是发生副教授法寄生蜂机发射机发生发生棵-philosopher Oh no demonstrated problem, law professor, associate professor of law occurred parasitoids machine transmitter happened happened with every tr
Philosopher(new)
- 这是一道经典的线程同步问题——哲学家吃饭问题。这里结合了win32使得这个问题可视化了-This is a classic thread synchronization -- philosopher food problem. Win32 here combination of this makes the issue of visualization
200511121433511933
- 很好用 OS的一个很好用的东西 很值得大家看看 哲学家就餐问题的很好的实现-good with a good OS, the things you look at the merits of the Dining Philosophers achieve good
chip(单片机源程序)
- 好东西 关于单片机的一些重要的代码本程序是操作系统中比较典型的线程同步算法中的哲学家进餐问题,为防止死锁,采取了两个条件(筷子空闲)同时满足时再允许进餐的办法来解决。期望与大家一起学习交流!-good things on SCM some important source of this procedure is more typical operating system threads simultaneously count the
PhilosopherDining
- windowsAPI编程实现哲学家用餐问题。 五个哲学家五个线程。监测死锁并解决-windowsAPI Programming dining philosophers problem. 5 philosopher five threads. Monitoring and addressing Deadlock
eat1
- 使用线程实现并发操作,解决操作系统中经典的哲学家吃饭问题,通过可视化演示。-use threads to achieve concurrent operation and solve operating system classic philosophers food, through visual demonstration.
jiucan
- 哲学家就餐问题,本人已经在网上找了很久啦,希望能和大家分享-dining philosophers problem, I have to find on the Internet -- for a long time, and we hope to share
CrazyPhilosopher
- Crazy Philosopher 演示关于操作系统多线程的经典的“哲学家吃饭问题”。-Crazy Philosopher demonstration multithreaded operating system on the classic "philosopher eat rice problem. "
p_eating
- 本程序是模拟哲学家进餐这个经典的操作系统的问题-the simulation procedure is the classic philosophers dining operating system problems
Dining.04
- 一个哲学家一起进餐的经典问题的一个程序,供交流学习之用-dine a philosopher of the classic problems of a procedure for the exchange of learning with
zhexuejiajincan
- 计算机操作系统原理与实现中的重要实验,关于哲学家进餐的问题-computer operating system Theory and the important experiments on the dining philosophers problem
多线程调度——哲学家就餐
- 利用JAVA线程,解决哲学家就餐问题。当某一哲学家线程执行取得筷子方法时, 程序会根据该线程的名称来确定该线程需要使用哪两支筷子,并且分辨出哪支筷子编号是奇数,按照先奇后偶的顺序来试图取得这两支筷子。 如果这两支筷子都未被使用(即对应的数组元素值为 false),该哲学家线程即可先后取得这两支筷子进餐,否则会在竞争某支筷子失 败后执行 wait()操作进入 Chopsticks 类实例的等待区, 直到其他的哲学家线程进餐完毕放下筷子时用