搜索资源列表
Wangmeng_3281411350
- 哲学家问题演示 不会哦，副教授法是发生副教授法寄生蜂机发射机发生发生棵-philosopher Oh no demonstrated problem, law professor, associate professor of law occurred parasitoids machine transmitter happened happened with every tr
操作系统课程设计之哲学家问题
- 这个好程序实现了操作系统中最著名的哲学家问题，很好的界面让人耳目一新-procedures for the good of the operating system and the most famous philosopher, a very good fresh and new interface
threadphilosopher
- 利用线程方案实现实现哲学家问题.设置五个信号量代表五把叉子，初使值均为1，表示5把叉子均可以取，设置五个线程代表5个哲学家，其值分别为0～4，规定奇数号的哲学家先拿起他左边的叉子,然后再去拿他右边的叉子 而偶数号的哲学家则相反.按此规定,将是1,2号哲学家竞争1号叉子,3,4号哲学家竞争3号叉子.即五个哲学家都竞争奇数号叉子,获得后,再去竞争偶数号叉子,最后总会有一个哲学家能获得两支叉子而进餐。而申请不到的哲学家进入阻塞等待队列，根FIFO原则，则先申请的哲学家会较先可以吃饭，因此不会出现饿死的
哲学家吃饭问题
- 哲学家吃饭问题 VB-philosopher food VB
哲学家吃饭问题Philos
- 哲学家编程的算法-philosopher programming algorithm
哲学家进餐问题
- 程序是操作系统中比较典型的线程同步算法中的哲学家进餐问题,为防止死锁,采取了两个条件(筷子空闲)同时满足时再允许进餐的办法来解决。
philosopher
- 用线程解决“N个哲学家”问题 1、目的： 学习线程的编程和同步
4
- 模拟“五个哲学家”问题 学习和掌握并发进程同步的概念和方法。
哲学家问题0
- 先用BACC编译,再用BAINTERP运行-using the BACC compiler, and then run BAINTERP
philosophy-five-jcsp
- 升级版本，五个哲学家问题,用jcsp 实现。
经典同步问题：5哲学家进餐
- 经典同步问题中的哲学家进餐问题（材料：哲学家5个，筷子5只。要求：每个哲学家必须取得2只筷子时才能进餐，进餐完放下筷子，不能有哲学家饿死。ps：各哲学家每个状态时间有随机性）-Classic synchronous problem :five philosophers have dinner(material:5 philosophers ,five chopsticks.Demand: Each philosophers must have dinner with 2 chopsticks,a
多线称关于哲学家就餐问题
- 这是个操作系统中,多线称关于哲学家就餐问题的演示程序!-This is the demo program for the multithread about philosophers having dinner problem in the operating system!
哲学家进餐
- 哲学家进餐问题，描述计算机系统的同步与互斥问题。-dining philosopher, describes the computer system synchronization and mutual exclusion problems.
philosopher(VC).rar
- 哲学家就餐问题（VC图形界面版，添加了暂停恢复演示功能）,philosopher eating demo
success3
- 哲学家问题，C++编的多线程模拟哲学家吃饭问题，运行前需要设置一下project-Philosophers problem, C++ code for multi-threaded simulation of philosophers problem of feeding the project need to set before running
uCOS-II_on_VC
- VS2008 & VC++6.0 版本基于ucos-ii的哲学家就餐问题的解决方法-VS2008 & VC++6.0 version solution to the the Dining Philosophers problem based on ucos-ii
philosopheDining
- 死锁--哲学家就餐问题.完整源码,并可直接运行.-Deadlock- dining philosophers problem. Complete source code can be run directly.
dining
- 哲学家就餐问题C语言演示程序，带窗口、对话框，有详细中英文注释-Dining philosophers problem of C language demo program with a window, dialog box, there are detailed notes in English and Chinese
eating
- 这是哲学家问题，采用C++语言来编程的。有界面运行！-This is the philosophers problem, using C++ programming language. There are interfaces to run!
典型死锁问题
- 包含了操作系统的三个死锁问题，哲学家问题，消费者生产者问题，管道等，解决方法。绝对可用。(It includes three deadlocks, philosophers, consumer producers, pipelines, and solutions to the operating system. It is absolutely available.)