搜索资源列表
thread
- 利用JAVA实现了多线程编程,解决哲学家就餐问题-JAVA achieved using multi-threaded programming, solve the dining philosophers problem
5
- 在unix下实验五，五个哲学家的问题以及一些相关的内容-In the experiment under unix five, five philosophers, as well as some relevant content
eating
- 操作系统中关于哲学家进餐问题的演示，哲学家左右两边的筷子，分别用一个变量表示，这是一个很经典的问题。该程序在VC环境下运行。-Operating system on the dining philosophers problem presentation, philosophers on both sides of the chopsticks, were used to express a variable, this is a ve
systemexperiment
- 几个实现操作系统算法的小程序 有哲学家 算法 生产者消费者等算法的实现 供初学者学习参考-Several algorithms to achieve a small operating system process philosophers algorithm producers consumers algorithm reference for beginners to learn
Semaphore
- 通过编程6个哲学家吃饭了解进程(线程)同步与死锁.-Programmed to eat six philosophers to understand the process (thread) synchronization and deadlock.
DiningPhilosophor1
- 哲学家进餐问题，课程设计，界面友好，实现功能很好。模拟了同步互斥-Dining philosophers problem, curriculum design, friendly interface and good functionality realize. Simulation of synchronous mutex
philosophy-five-jcsp
- 升级版本，五个哲学家问题,用jcsp 实现。-Upgraded version of the five philosophers problem, with jcsp realize.
philosopher
- 哲学家就餐问题，一共七个哲学家，无限循环。结束进程才能停止程序-Dining philosophers problem, a total of seven philosophers, infinite loop. The end of the process in order to stop the procedure
philo
- 用pthread实现哲学家问题，利用信号量实现同步。-Pthread problems with philosophers realize, realize synchronization using semaphores.
zhexuejia
- linux用多线程同步方法解决哲学家就餐问题(Dining-Philosophers Problem)-linux using multi-thread synchronization methods to solve the problem dining philosophers (Dining-Philosophers Problem)
TC-ucos-philos-comment-in-detail
- TC-ucos-philos-详细注释.rar 用TC编译ucos并在图像化界面下演示哲学家就餐问题，采用信号量机制，程序有BUG，不能顺利运行，但是我写了很多注释，有兴趣的朋友可以继续做下去，我的邮箱xuxi009@163.com可与我联系。注意图形界面驱动的路径要和源文件中的相同否则无法显示图形界面，相信用过TC的图形界面的明白，呵呵。-TC-ucos-philos-detailed notes. Rar uCOS com
ARM-UCOS-philos
- 在S3C44b0上移植ucos并实现哲学家就餐问题的演示，信息从uart0口输出，这是我学习上课时做的一个实验，见笑见笑了-S3C44B0 uCOS transplantation in the dining philosophers problem and the realization of the demonstration, information from the UART0 port output, this is my l
java_threaddemo
- 哲学家就餐是一个经典的Java多线程编程的实例，这是图形版。涉及到线程同步与互斥，临界区访问问题以及避免死锁的方法。 -Dining philosophers is a classic multi-threaded Java programming examples, this is the graphics version. Related to thread synchronization and mutual exclusion,
eating
- 哲学家就餐问题 哲学家就餐问题 哲学家就餐问题-Dining philosophers problem Dining philosophers problem Dining philosophers problem
philosopheDining
- 死锁--哲学家就餐问题.完整源码,并可直接运行.-Deadlock- dining philosophers problem. Complete source code can be run directly.
zhexuejia
- 计算机操作系统，哲学家就餐问题，C源代码。-Computer operating system, philosophers eat, C source code.
dining_philosopher.tar
- 哲学家进餐经典算法的pthread多线程实现代码-Classic dining philosophers pthread algorithm to achieve multi-threaded code
PhilosopherDining
- 在 WINDOWS 系统中实现哲学家就餐问题的死锁和不死锁两种解法。-WINDOWS system to achieve in the dining philosophers problem of deadlock and deadlock two solution.
zhwxuejia
- 一群哲学家围坐在一个圆桌，手上持有密码m，并从1开始编了号取初值m，哲学家从1开始报数, 报到m的哲学家停止吃饭，退出圆桌，求哲学家退出的顺序。要求:n和初值m由完家输入.手上的密码随机产生.最后要打印出编号对应的密码，输出哲学家离开的相后顺序-A group of philosophers sitting in a round-table, holding hands password m, and from the No. 1 st
001
- 一群哲学家围坐在一个圆桌，手上持有密码m，并从1开始编了号取初值m，哲学家从1开始报数, 报到m的哲学家停止吃饭，退出圆桌，求哲学家退出的顺序。要求:n和初值m由完家输入.手上的密码随机产生.最后要打印出编号对应的密码，输出哲学家离开的相后顺序-A group of philosophers sitting in a round-table, holding hands password m, and from the No. 1 s