搜索资源列表
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 law on the issue of the Dinin
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
fivephilosopher
- 假如所有的哲学家都同时拿起左侧叉子，看到右侧叉子不可用，又都放下左侧叉子，等一会儿，又同时拿起左侧叉子，如此这般，永远重复。对于这种情况，即所有的程序都在无限期地运行，但是都无法取得任何进展，即出现饥饿，所有哲学家都吃不上饭。所以规定奇数号的哲学家先拿起他左边的叉子,然后再去拿他右边的叉子 而偶数号的哲学家则相反.按此规定,将是0,1号哲学家竞争0号叉子,2,3号哲学家竞争2号叉子.即五个哲学家都竞争奇数号叉子,获得后,再去竞争偶数号叉子,最后总会有一个哲学家能获得两支叉子而进餐。而申请不到的哲
threadphilosopher
- 利用线程方案实现实现哲学家问题.设置五个信号量代表五把叉子，初使值均为1，表示5把叉子均可以取，设置五个线程代表5个哲学家，其值分别为0～4，规定奇数号的哲学家先拿起他左边的叉子,然后再去拿他右边的叉子 而偶数号的哲学家则相反.按此规定,将是1,2号哲学家竞争1号叉子,3,4号哲学家竞争3号叉子.即五个哲学家都竞争奇数号叉子,获得后,再去竞争偶数号叉子,最后总会有一个哲学家能获得两支叉子而进餐。而申请不到的哲学家进入阻塞等待队列，根FIFO原则，则先申请的哲学家会较先可以吃饭，因此不会出现饿死的
DINPHIL
- D:\\jh\\哲学家吃饭\\DINPHIL.rar哲学家吃饭-D : \\ jh \\ philosopher eat \\ DINPHIL.rar philosopher dinner
task3
- ucosii小实验任务3 哲学家就餐，可以帮助学习嵌入式操作系统-ucosii small experimental task three dining philosophers can help embedded operating system
DINING
- 哲学家吃饭的好东东，一定要好好研究研究哦!-philosopher Wanton good meal, we must carefully study a Oh!
Philosophers
- 哲学家进餐问题，进程是独立参与分配资源的最小单位，在有线程的OS中，线程是运行的最小单位， 课堂所述进程之间的同步与互斥，实际上是属于不同进程的线程间的同步与互斥，当 然，属于同一进程的不同线程一样存在同步与互斥，其控制同步与互斥的原理跟进程 是一样的-dining philosophers problem, the process is independent participation in the allocation of resources as the smallest
zhexue05
- 进程同步,哲学家进餐共享临界区变量.定义信号量机制控制进程不互斥!-process synchronization, philosopher dining area share critical variables. Definition signal to the process control mechanism not contradict!
jiou05
- 奇偶哲学家通过信号量机制控制进程的同步和互斥访问临街区域,保证正常执行!-signal through the volume control mechanism for the process of synchronization and mutex visit to the region along the street to ensure normal execution!
philosophers05
- 经典进程同步和互斥另类WINDOWS解法.定义信号量机制在WINDOWS下完成哲学家进餐问题.-classical process synchronization and mutex WINDOWS alternative solution. Volume definition signal mechanism in Windows complete the dining philosophers problem.
zhexuejiasuanfa
- 操作系统中的哲学家就餐算法 c语言编写-OS philosopher dine algorithm c language