Description: 哲学家就餐问题，本人已经在网上找了很久啦，希望能和大家分享-dining philosophers problem, I have to find on the Internet-- for a long time, and we hope to share Platform: |
Size: 3072 |
Author:ken |
Hits:
Description: 计算机操作系统原理与实现中的重要实验，关于哲学家进餐的问题-computer operating system Theory and the important experiments on the dining philosophers problem Platform: |
Size: 539648 |
Author:mantian |
Hits:
Description: 哲学家进餐问题
在多线程中如何避免死锁。
问题描述：有五位哲学家围绕着餐桌坐，每一位哲学家要么思考
要么等待，要么吃饭。为了吃饭，哲学家必须拿起两双筷子（分
别放于左右两端）不幸的是，筷子的数量和哲学家相等，所以每
只筷子必须由两位哲学家共享-dining philosophers problem in multithreaded how to avoid deadlock. Problem description : five philosophers sitting around the table, each one philosopher or thinking either wait or eat. To eat, philosopher must take up the PRC chopsticks (up to around two ends) Unfortunately, chopsticks equal to the volume and philosopher, so each must chopsticks from two philosophers sharing Platform: |
Size: 34816 |
Author:何冰 |
Hits:
Description: 在Linux环境下，使用共享外部变量的方式，实现哲学家进餐问题-the Linux environment, the use of shared external variables, to achieve the Dining Philosophers Problem Platform: |
Size: 5120 |
Author:weixiang |
Hits:
Description: 哲学家就餐问题，显示线程的关系，采用信号量产生互斥的功能-Dining philosophers problem, show the relationship between threads, using semaphore have mutually exclusive features Platform: |
Size: 11264 |
Author:孟小磊 |
Hits:
Description: 哲学家进餐问题，经典的同步问题，是初学者很好的学习材料-Dining philosophers problem, the classical synchronization problem is a very good learning materials for beginners Platform: |
Size: 2536448 |
Author:linweiyong |
Hits:
Description: 模拟哲学家进餐的同步问题，实现一个既没有两邻座同时吃饭，又没有人饿死（永远拿不到一双筷子）的算法-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 of chopsticks) algorithm Platform: |
Size: 1010688 |
Author:梁先生 |
Hits:
Description: ucos-dining-philosopher.rar
ucos下的哲学家就餐问题（dining philosopher problems)，采用信号量机制解决，有截图和感悟。dos界面文字演示（另有图形界面）。-ucos-dining-philosopher.rarucos under the dining philosophers problem (dining philosopher problems), using semaphore mechanism to resolve screenshot and insights. dos interface text presentation (otherwise graphical interface). Platform: |
Size: 281600 |
Author:xuxi |
Hits:
Description: 本程序是在Linux下面 实现了哲学家就餐问题。其中演示了会发生死锁和不会发生死锁的情况。-This program is implemented in the Linux following the Dining Philosophers Problem. Which demonstrates the deadlock and does not happen will happen deadlock situation. Platform: |
Size: 2048 |
Author:文锋 |
Hits:
Description: 这个程序可以演示关于哲学家就餐的问题，对于理解线程的相互等待有很好的作用-This procedure can be demonstrated on the Dining Philosophers problem, each thread to wait for understanding the role of good Platform: |
Size: 1951744 |
Author:刘亚云 |
Hits:
Description: 哲学家就餐问题 实现5个哲学家5支筷子的就餐问题涉及到AND型信号量，线程的阻塞唤醒切换功能-Dining philosophers problem to achieve five dining philosophers five chopsticks issues related to the AND-type semaphore, blocking thread switching wake Platform: |
Size: 3072 |
Author:陈蓝 |
Hits:
Description: 多线程解决哲学家就餐问题，实现进程与线程间的同步。-Multi-threading to solve the dining philosophers problem, to achieve synchronization between processes and threads. Platform: |
Size: 2048 |
Author:陈文 |
Hits:
Description: 操作系统之哲学家就餐问题的算法实现，利用java开发语言-The operating system of the dining philosophers problem algorithm Platform: |
Size: 3072 |
Author:hanziwen |
Hits:
Description: 哲学家就餐问题是一道十分经典的进程同步问题。该道题旨在解决当资源有限时（可能产生死锁），如何有效地避免死锁的问题。本实验选取“and”型信号量的解决办法，只有当哲学家具备同时拿到左右两只筷子的能力时，才能吃饭。否则，若则学家只能能够拿到一只筷子时，他只能放弃这只筷子，供其他可能需要这只筷子的哲学家使用。这样，只有哲学家左右两人均不进食时，该哲学家才有吃饭的权利。采取这种方法可以有效地避免死锁的产生。-The dining philosophers problem is a very classic process synchronization problem. This question is designed to address the problem (which may produce deadlock) when resources are limited, how to avoid deadlocks. In our study, " and" type signal amount of solution only when philosophers have the ability to get around two chopsticks to eat. Otherwise, if the scientist can only be able to get a chopsticks, he can only be waived only chopsticks for the other may need to use only chopsticks philosopher. In this way, only philosophers around two people are not eating, the philosopher have the right to eat. Adopt this method can effectively avoid the generation of deadlock. Platform: |
Size: 9717760 |
Author: |
Hits:
Description: 操作系统中关于冲突的哲学家就餐问题的简单实现-Simple implementation of the operating system on the dining philosophers problem of conflict Platform: |
Size: 2048 |
Author:金 |
Hits:
Description: c++程序，利用信号量解决哲学家就餐问题，非常好用-c++ program using semaphores to solve the dining philosophers problem, very easy to use Platform: |
Size: 1024 |
Author:Dufresen |
Hits:
Search - The Dining Philosophers Problem