搜索资源列表
ChopStickTest
- 哲学家就餐问题java版。我对这个知道的不多，大家可以研究研究。-dining philosophers problem java version. I know this much, and we can studies.
哲学家就餐问题分析
- 该问题与以前经典的五个哲学家五根筷子不同，这次是每个哲学家身边均有一副刀叉，总的资源是充足的-problems with the previous five classic philosophers five different chopsticks, this is the philosopher of each side have a knife and fork, the total resources are adequate
zhexuejia
- 计算机操作系统哲学家就餐问题的课程设计报告。无解压密码。-computer operating system dining philosophers problem of the design report. No extract passwords.
thread
- 利用JAVA实现了多线程编程,解决哲学家就餐问题
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, critical area to visit, as we
operation-2
- 哲学家就餐问题--操作系统理解pv原语 解决进程间同步问题-operation problem of Dining Philosophers
philosopher_java
- 这是Java图片版的哲学家就餐经典问题的实现，虽然界面简单，但是对于情况的模拟还是比较真实的。-This is a Java image version of the classic dining philosophers problem to achieve, although the interface simple, but for the simulation of the situation is quite true.
java_threaddemo
- 哲学家就餐是一个经典的Java多线程编程的实例，这是图形版。涉及到线程同步与互斥，临界区访问问题以及避免死锁的方法。 -Dining Philosophers is a classic example of Java multi-threaded programming, it is graphic version. Related to thread synchronization and mutual exclusion, critical access issues and ways to
zhexuejiajiucanwenti
- 这是用C#语言开发实现的哲学家经典的就餐问题，利用线程实现。-This is achieved with the C# language development of the classic dining philosophers problem, using threads to achieve.
ZxjFrame
- 哲学家就餐问题，图像化描述，可以让你能更加好的理解相关操作系统问题。-Dining philosophers problem, descr iption of the image, allowing you to more good understanding of the issues related to the operating system.
problem
- 哲学家就餐问题的解决，操作系统中线程与并发的问题-Solution to the dining philosophers problem
123
- 哲学家就餐问题的解决方案，有详细的注释，线程兵法问题的解决-Dining Philosophers solution to the problem, detailed notes, problem solving thread art of war
main
- 柔性机械制造系统死锁的防止方法仿真哲学家就餐问题的java程序研究 -Flexible Manufacturing Systems deadlock prevention method for simulation of the dining philosophers problem of java program
philosophy
- 哲学家就餐问题，五个哲学家只有五只筷子，保证所有哲学家不饿死的情况下实现就餐问题！-about the philosopher‘s dinner
PhilosopherProblem
- 编写P、V操作和信号量的模拟程序，然后用它们解决不死锁的哲学家就餐问题，并把哲学家们的活动过程用文字或可视化表示出来。-Write P, V operation and the amount of signal simulation program, and then use them to solve the undead philosophers of the lock repast questions and to the process of the philosophers in wo
Phy
- 操作系统 哲学家就餐问题 java实现 java代码-Operating system, the dining philosophers problem java java code
11331237_majun
- 解决哲学家就餐问题避免死锁使每个哲学家都不会被饿死-Solution to the dining philosophers problem to avoid deadlock so that each philosopher will not be starved to death
philosopher
- 哲学家就餐问题是在计算机科学中的一个经典问题，用来演示在并行计算中多线程同步(Synchronization)时产生的问题。-Dining Philosophers problem is a classic computer science problem, used to demonstrate multi-thread synchronization in parallel computing (Synchronization) problems arising.
java
- 哲学家就餐问题，现代机械制造中的柔性系统模拟仿真-Dining philosophers problem, modern machinery manufacturing flexible system simulation
多线程调度——哲学家就餐
- 利用JAVA线程，解决哲学家就餐问题。当某一哲学家线程执行取得筷子方法时， 程序会根据该线程的名称来确定该线程需要使用哪两支筷子，并且分辨出哪支筷子编号是奇数，按照先奇后偶的顺序来试图取得这两支筷子。 如果这两支筷子都未被使用(即对应的数组元素值为 false)，该哲学家线程即可先后取得这两支筷子进餐，否则会在竞争某支筷子失 败后执行 wait()操作进入 Chopsticks 类实例的等待区， 直到其他的哲学家线程进餐完毕放下筷子时用 notifyAll()将其唤醒。当某一哲学家线程放下筷子时