搜索资源列表
philsophy
- 哲学家就餐问题例子-dining philosophers problem example
哲学家就餐问题c语言实现
- c语言实现的哲学家就餐问题
ipc
- ipc通信，哲学家就餐问题 采用信号量控制-ipc communications, dining philosophers problem using semaphores control
zhexue
- 通过研究Linux的线程机制和信号量实现哲学家就餐问题的并发控制-By studying the Linux thread and semaphore mechanisms to achieve dining philosophers problem of concurrency control
shell
- unix的shell编程，实现了哲学家就餐问题和，圆周率运算问题-unix' s shell programming, the dining philosophers problem and, pi computing problems
phenosophy
- 本程序是在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.
bss
- 实现哲学家就餐问题Linux+C DiningPhilosophers-Linux C DiningPhilosophers DiningPhilosophers DiningPhilosophers
chopsticks
- 哲学家就餐问题。五个哲学家，五把叉子，来实现思考和就餐-Dining philosophers problem. Five philosophers, five forks to achieve thinking and dining
exp1
- Linux环境下，新型的，解决哲学家就餐问题和生产者消费者问题的算法。-Under Linux, a new solution to the dining philosophers problem algorithm.