搜索资源列表
Philosopher-dine
- 简单的哲学家进餐问题解决方案，使用互斥线程-Simple solutions to dining philosophers problem, using mutually exclusive threads
[java]philosophers-eating
- 本java设计模拟经典的哲学家进餐的同步问题，实现一个既没有两邻座同时吃饭，又没有人饿死（永远拿不到一双筷子）的算法。内附运行说明。-The Java design simulation of the classic dining philosophers synchronization issues, to achieve a two sitting next to him to eat, and no one starved to
zhexuejiajiucan
- 这是操作系统这门可的作业---哲学家进餐问题，用vc6.0编的，语言是c，可以说是windows程序设计吧-This is the operating system is working- the dining philosophers problem, with vc6.0 compiled language is c, can be said that the windows programming
zhexuejiawenti
- 对哲学家进餐问题可设置有五位哲学家，可以设置初始的状态，根据需要输入某一位哲学家拿起相应的筷子，由系统判断是否可以进餐-the man eat or put down kuaizi
multiThread
- Java多线程基本使用与若干典型实例（如哲学家进餐、生产者消费者问题）-Java MultiThread example application code,include some famous issue like Philosophcian eatting,Producter and Consumer
Event
- 基于Visual Studio 2008 编写的一个哲学家进餐问题，事件对象。-Event，MultiThread in Visual Studio 2008
philosophers
- 通过实现哲学家进餐问题的同步深入了解和掌握进程同步和互斥的原理-Through the dining philosophers problem of synchronization-depth understanding and mastery of process synchronization and mutual exclusion principle
Dzhexuejiai
- 哲学家进餐问题，实现多进程间的互互斥访问，进程间的竞争可直接使用。 -The dining philosophers problem, to achieve the mutual exclusive access to the multi-process, the competition between processes can be used directly.
philosophers
- 哲学家进餐例子。 哲学家问题的大意是：5个哲学家围坐在一张圆桌周围，每个哲学家面 前有一碟通心面,要使用筷子才能进餐。相邻两个碟子之间有一根筷子。哲 学家包含三种状态：吃饭、思考和挨饿。当一个哲学家觉得饿时，他才试 图分两次去取他左边和右边的筷子就餐，吃完以后放下筷子继续思考。-The dining philosophers example. Philosophers problem to the effect that:
Dphilosopheri
- 哲学家进餐问题是荷兰学者Dijkstra 提出的经典问题之一,它是一个信号量机制问题的应用,在操作系统文化史上具有非常重要的地位。对该问题的剖析有助助于学生深刻地理解计算机系统中的资源共享、进程同步、死锁等问题,并能熟练地应用信号量来解决生活中的控制流程,即将生活中的控制流程用形式化的方式表达出来。 -The dining philosophers problem is one of the Dutch scholar Dijkst
Question3
- 图形化界面的哲学家进餐问题，图 形化界面的哲学家进餐问题-Graphical interface dining philosophers problem, dining philosophers problem graphical interface, a graphical interface dining philosophers problem
Multitasking_Programming_On_VxWorks
- 通过一个经典的多任务同步哲学家进餐问题。介绍了VxWorks 下的多任务程序 设计和任务间通信机制，并给出了运行的结果。-Multi-task synchronization through a classic dining philosophers problem. Under VxWorks multitasking programming and inter-task communication mechanisms, and
Philosophy_Eating
- 进餐问题 计算机操作系统中的哲学家进餐问题-Dining problem
zhexuejiajiucan
- 操作系统课程设计——哲学家进餐问题，进程的3种关系-Courses on operating system design- dining philosophers problem, the process relationship
dinning
- 有关操作系统的经典问题，哲学家进餐问题。利用多线程模拟了进餐，并讨论了死锁问题。-For the classic problem of the operating system, the dining philosophers problem. Using multi-thread simulation meal, and discussed the deadlock problem.
Eating
- 模拟哲学家进餐问题，利用信号量、互斥锁等进行线程间的同步。-Analog dining philosophers problem, the use of semaphores, mutexes, etc. synchronization between threads.
Dining-Philosophers
- 关于哲学家进餐的问题，运用了mfc，有动态演示效果-About the Dining Philosophers problem, the use of mfc, dynamic demonstration effect。。
shiyan2
- 哲学家进餐问题 #include<stdio.h> #include<semaphore.h> #include<pthread.h> //宏定义信号量个数为5,宏定义0表示思考,宏定义1表示饿,宏定义2表示吃,宏定义(ph_num+4) N表示左,宏定义(ph_num+1) N表示右 #define N 5 #define THINKING 0 #define H
src
- 研究死锁时的经典案例，哲学家进餐，这里有五个不同的实现（因为在对这个问题的研究过程中前人提出了很多的思路），这里实现了最经典常见的五种-The Case Study of deadlock, the Dining Philosophers, here are five different implementations (as in the study of this issue in the previous made a lot o
CPPzhexuejia
- 这是采用C++的语言编写的程序，实现哲学家进餐问题的解决的方法-This is the use of written procedures C++ achieve settlement method Dining Philosophers Problem