搜索资源列表
PHI
- 哲学家就餐问题，显示线程的关系，采用信号量产生互斥的功能
zhexuejia
- 计算机操作系统，哲学家就餐问题，C源代码。-Computer operating system, philosophers eat, C source code.
Dining_philosophers
- 用VC实现的哲学家就餐问题，其中用到了信号量的宏，并多线程的方法，模拟哲学家就餐问题。-Implementation using VC dining philosophers problem, use one of the semaphore macros, and multi-threaded approach, Analog dining philosophers problem.
zhexuejiawenti
- 哲学家就餐问题 进程管理 -Dining philosophers problem of process management
Philosophers
- 哲学家就餐问题，他们每个人的左边都有一支筷子，解决死锁问题-Dining philosophers problem, the left side of each of them has a chopsticks, solve the deadlock problem
1212
- 哲学家算法，利用多线程解决哲学家就餐问题-Philosophers algorithm, using multiple threads to solve the problem dining philosophers
DiningPhilosophers
- 六个哲学家就餐问题,体验进程(线程)和死锁的问题.本实验设计个哲学家共享一个相同的线程,既完成线程同步,又预防死锁发生.-6 dining philosophers problem, experience the process (thread) and deadlock issues. The experimental design a philosopher share a similar thread, both complete thread synchronization, but a
philosophersproblem
- 利用多线程技术实现生产者－消费者问题以及n个哲学家就餐问题，其中生产者或消费者或哲学家用不同线程实现-Using multi-threading technology producer- consumer issues and the n-dining philosophers problem, in which the producer or consumer or a philosopher to achieve a different thread
philpsopher
- 哲学家就餐问题的解决方法 运用java多线程模拟所有解决哲学家就餐问题的方法-Solution to the dining philosophers problem using multi-threaded simulation of java all the dining philosophers problem solving
thread
- 实验总体要求，使用MFC相关的功能函数来模拟经典进程互斥和同步问题 生产者和消费者 读者和写者 哲学家就餐问题-The general requirements of experiments, the use of MFC function to simulate the functions related to the classical problem of mutual exclusion and synchronization producers and consumers,
Dining-philosophers-problem
- 哲学家就餐问题 实现5个哲学家5支筷子的就餐问题涉及到AND型信号量，线程的阻塞唤醒切换功能-Dining philosophers problem to achieve five dining philosophers five chopsticks issues related to the AND-type semaphore, blocking thread switching wake
Dinning-philosophers
- 在linux下“哲学家就餐”问题的一种解法-a solution of "dining philosophers" problem under Linux
philosophy-dining
- 多线程解决哲学家就餐问题，实现进程与线程间的同步。-Multi-threading to solve the dining philosophers problem, to achieve synchronization between processes and threads.
DineRun
- JAVA多线实现哲学家就餐问题-JAVA multi-line to achieve the dining philosophers problem
philosopher
- 使用多线程来解决哲学家就餐问题的源代-To use multiple threads to solve the source code for the dining philosophers problem
exampleofOScommunication
- 操作系统进程/线程信号量机制实现通信的实例，有生产者消费者问题和哲学家就餐问题的程序代码。-Operating system process/thread semaphore mechanism to achieve communication examples, there are producers and consumers and the dining philosophers problem program code.
dining-philosophers-varellow
- 哲学家就餐问题算法仿真，使用windows下多线程编程-Dining philosophers problem algorithm simulation
phio
- 哲学家就餐问题是在计算机科学中的一个经典问题，用来演示在并行计算中多线程同步(Synchronization)时产生的问题。-Dining philosophers
requirempqusmemberhard
- 这是个操作系统中,多线称关于哲学家就餐问题的演示程序!很好不错()