搜索资源列表
aboutlunch
- 关于UC/OSII的应用，任务三哲学家就餐问题，对更深入理解操作系统基本原理非常有帮助-With regard to UC/OSII applications, tasks, three dining philosophers problem, more in-depth understanding of the basic principles of the operating system is very helpful
exp4
- 哲学家就餐问题C语言模拟，pthread库实现-The Dining Philosophers Problem C language simulation, pthread library implementation
test
- 设计实现哲学家就餐问题。有五个哲学家围坐在一圆桌旁， 桌中央有一盘通心粉， 每个人面前有一只空盘子， 每俩人之间放一只筷子， 每个哲学家的行为是思考， 感到饥饿， 然后吃通心粉。 为了吃通心粉， 每个哲学家必须拿到两只筷子， 并且每个人只能直接从自己的左边或右边去拿筷子。-Design and implementation of the Dining Philosophers Problem. There are five philosophers sitting around a round
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.
Philosophers
- 这个程序可以演示关于哲学家就餐的问题，对于理解线程的相互等待有很好的作用-This procedure can be demonstrated on the Dining Philosophers problem, each thread to wait for understanding the role of good
shiyan
- 操作系统中哲学家就餐产生死锁问题及如何避免死锁 -Dining Philosophers operating system problems arise and how to avoid deadlock deadlock
deadkey
- 哲学家就餐问题，解决操作系统中的死锁问题。五个哲学家围坐圆桌，每两个人中间有一只筷子，吃饭时必须拿两只筷子，而且只能拿自己两边的筷子，从而造成死锁问题。-Dining Philosophers problem, to solve the deadlock problem of the operating system. Five philosophers sitting around the round table, the middle one for every two chopsticks
seafrog
- 这是用C#语言开发的哲学家就餐问题，利用线程实现的。-This is the C# language development with dining philosophers problem, using threads to achieve.
1212
- 哲学家算法，利用多线程解决哲学家就餐问题-Philosophers algorithm, using multiple threads to solve the problem dining philosophers
zhexuejiajiucan
- 解决软件开发中常见的哲学家就餐问题，很好用的程序，希望对你有开发有帮助。-To solve common software development dining philosophers problem, a good use of the program, want to help you develop.
maicunguanli
- 解决软件开发中常见的哲学家就餐问题，很好用的程序，希望对你有开发有帮助,UCOS下开发的。-To solve common software development dining philosophers problem, a good use of the program, want to help you develop, UCOS under development.
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
ucos_Philosopher_Repast
- uC/OS哲学家就餐演示.这个程序演示基本的哲学家就餐问题的解决。程序启动具有五个不同优先级的任务，每个任务对应一个 * 哲学家，完成一系列动作.-uC/OS Dining Philosophers presentation. This program demonstrates the basic dining philosophers problem to solve. Program starts with five different priority tasks, each tas
2008130283
- 设计解决哲学家就餐的并发线程，采用了3种预防死锁的方法（摒弃‘环路等待’条件，摒弃‘请求和保持’条件，摒弃‘不剥夺’条件），要预防死锁，只采用其中的任何一种方法即可。-Design of concurrent threads Dining Philosophers solution, using a 3 way deadlock prevention (discard ' Circle wait' conditions, get rid of ' request and to
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
123
- 哲学家就餐问题的解决方案，有详细的注释，线程兵法问题的解决-Dining Philosophers solution to the problem, detailed notes, problem solving thread art of war
OS
- 本学期操作系统的两次试验打包，银行家算法，PV操作中的哲学家就餐问题和生产者消费者问题，小程序仅供参考~-This semester, two tests of the operating system package, bankers algorithm, PV operation of the dining philosophers problem and producers of consumer issues, small programs for reference ~
Philosopher
- 哲学家就餐问题 操作系统模拟实验解答，详细具体-Dining philosophers problem
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,