搜索资源列表
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
zhexuejiajiucanwenti
- 这是用C#语言开发实现的哲学家经典的就餐问题，利用线程实现。-This is achieved with the C# language development of the classic dining philosophers problem, using threads to achieve.
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
peopleeat
- 用MFC编写的哲学家进餐问题，了解多线程的作用-Written with MFC dining philosophers problem, to understand the role of multi-threaded
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
manypeopleeatfood
- 5个哲学家决定筷子当前是否可用，筷子如果被人拿起，则不可用，放下则哲学家可用就餐，只有5只筷子，哲学家两个动作，就餐或思考问题-5 philosophers decide whether the current available chopsticks, chopsticks if it is picked up is not available, put the philosopher can eat only five chopsticks, philosopher two movement
3281411350
- C++ 哲学家进餐问题。 就这样，可以了 -C++ dining philosophers problem
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
code
- C++写的，是关于哲学家进餐问题的代码.希望大家喜欢，多提建议-Written in C++ is the code on the dining philosophers problem
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
eat
- 计算机仿真技术里面的经典问题：哲学家用餐问题的mfc实现，感兴趣的同志可以-Inside the computer simulation of the classic problems: dining philosophers problem mfc implementation can be a good look gay interest
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 ~
philosophersproblem
- 使用C++编程语言实现哲学家进餐问题，以模拟实现操作系统资源是如何利用的-Use C++ programming language dining philosophers problem, to achieve the operating system to simulate how the use of resources
zhe4
- 哲学家进餐问题，用于观察进程之间互斥问题，知道进程之间关系-Petri Net Model to Solve the Dining Philosophers Problem and Implementation