搜索资源列表
Philosopher
- 哲学家就餐问题在windows下的实现。动态打印哲学家进程的状态（就餐、等待、思考）-The dining philosophers problem under windows. The state of the process of dynamic print philosopher (eating, waiting, thinking)
Phy
- 操作系统 哲学家就餐问题 java实现 java代码-Operating system, the dining philosophers problem java java code
philosopher
- 使用多线程来解决哲学家就餐问题的源代-To use multiple threads to solve the source code for the dining philosophers problem
philosopher
- 哲学家就餐问题，有左撇子，至少使用信号量、消息通信、管程三种方式之中的一种模拟哲学家就餐问题。 用一个输入变量控制是否有左撇子哲学家。如果有，其数量由随机数生成。 模拟程序分为两种情况， 可能发生死锁的情况，输出发生死锁时的资源分配状态和历史资源分配状态； 设计没有死锁发生的程序，当每个哲学家至少完成一次就餐后，输出资源分配给哲学家的当前状态和历史状态。 最好具备图形界面，动态显示哲学家就餐的过程。-Dining philosophers problem, a left-ha
Philosopher
- CSharp写的哲学家就餐算法，包括安全和不安全调度的实现，有图形界面。-CSharp written in the dining philosophers algorithm, including the safe and unsafe scheduling, graphical interface.
zhexuejiajincansuanfa
- 哲学家就餐算法的一种(最节约资源的)java实现方法。-The dining philosophers an algorithm java implementation (resource conservation).
semaphore
- 关于操作系统的信号量的应用，就是哲学家就餐问题-Semaphore about the operating system, applications, is the dining philosophers problem
Dining-philosophers
- 操作系统之哲学家就餐问题的算法实现，利用java开发语言-The operating system of the dining philosophers problem algorithm
Philosopher
- 通过哲学家就餐问题展示了三种不同的预防死锁的方法。-Shows three different deadlock prevention method through the dining philosophers problem.
zhexuejia
- linux下的多线程哲学家就餐问题，linux下运行可以通过！-multithreaded dining philosophers problem under linux
i
- 关于哲学家就餐算法的一种实现，图片没有加入，可以自己加入就好了-An implementation of the dining philosophers algorithm, the picture does not join, you can add yourself to me
zhexuejia
- 在windows界面下，运用VC++6.0工具，实现哲学家就餐问题，状态分为等待、就餐、思考。-Windows interface use VC++6.0 tools, the dining philosophers problem, the state is divided into waiting, eating, thinking.
Dining-philosophers-problem
- 哲学家就餐问题是一道十分经典的进程同步问题。该道题旨在解决当资源有限时（可能产生死锁），如何有效地避免死锁的问题。本实验选取“and”型信号量的解决办法，只有当哲学家具备同时拿到左右两只筷子的能力时，才能吃饭。否则，若则学家只能能够拿到一只筷子时，他只能放弃这只筷子，供其他可能需要这只筷子的哲学家使用。这样，只有哲学家左右两人均不进食时，该哲学家才有吃饭的权利。采取这种方法可以有效地避免死锁的产生。-The dining philosophers problem is a very classi
dinner
- 哲学家就餐问题，死锁和不死锁的情况都能运行，VS2010测试-Dining philosophers problem, deadlock and deadlock can run, VS2010 test
11331237_majun
- 解决哲学家就餐问题避免死锁使每个哲学家都不会被饿死-Solution to the dining philosophers problem to avoid deadlock so that each philosopher will not be starved to death
dining-philosophers
- 图形化的c++哲学家就餐,里面包含工程的文件描述等！-Graphical dining philosophers, c++ contains project file descr iption, and so on!
philosopher
- 哲学家就餐问题是在计算机科学中的一个经典问题，用来演示在并行计算中多线程同步(Synchronization)时产生的问题。-Dining Philosophers problem is a classic computer science problem, used to demonstrate multi-thread synchronization in parallel computing (Synchronization) problems arising.
exampleofOScommunication
- 操作系统进程/线程信号量机制实现通信的实例，有生产者消费者问题和哲学家就餐问题的程序代码。-Operating system process/thread semaphore mechanism to achieve communication examples, there are producers and consumers and the dining philosophers problem program code.
java
- 哲学家就餐问题，现代机械制造中的柔性系统模拟仿真-Dining philosophers problem, modern machinery manufacturing flexible system simulation
Philo
- 哲学家就餐问题（C语言实现），操作系统上的内容，对初学者很有启发-Dining philosophers problem (C language), the contents of the operating system, is very instructive for beginners