搜索资源列表
chip（单片机源程序）
- 好东西 关于单片机的一些重要的代码本程序是操作系统中比较典型的线程同步算法中的哲学家进餐问题,为防止死锁,采取了两个条件(筷子空闲)同时满足时再允许进餐的办法来解决。期望与大家一起学习交流!-good things on SCM some important source of this procedure is more typical operating system threads simultaneously count the
p_eating
- 本程序是模拟哲学家进餐这个经典的操作系统的问题-the simulation procedure is the classic philosophers dining operating system problems
zhexuejiajincan
- 计算机操作系统原理与实现中的重要实验，关于哲学家进餐的问题-computer operating system Theory and the important experiments on the dining philosophers problem
Philosophers
- 哲学家进餐问题，进程是独立参与分配资源的最小单位，在有线程的OS中，线程是运行的最小单位， 课堂所述进程之间的同步与互斥，实际上是属于不同进程的线程间的同步与互斥，当 然，属于同一进程的不同线程一样存在同步与互斥，其控制同步与互斥的原理跟进程 是一样的-dining philosophers problem, the process is independent participation in the allocation
zhexue05
- 进程同步,哲学家进餐共享临界区变量.定义信号量机制控制进程不互斥!-process synchronization, philosopher dining area share critical variables. Definition signal to the process control mechanism not contradict!
philosophers05
- 经典进程同步和互斥另类WINDOWS解法.定义信号量机制在WINDOWS下完成哲学家进餐问题.-classical process synchronization and mutex WINDOWS alternative solution. Volume definition signal mechanism in Windows complete the dining philosophers problem.
dinning
- 哲学家进餐的问题，用程序模拟实现，解释死锁的产生、解除以及预防-dining philosophers problem, simulation procedures, explained Deadlock in lifting and prevention
lunch
- 哲学家进餐问题 在多线程中如何避免死锁。 问题描述：有五位哲学家围绕着餐桌坐，每一位哲学家要么思考 要么等待，要么吃饭。为了吃饭，哲学家必须拿起两双筷子（分 别放于左右两端）不幸的是，筷子的数量和哲学家相等，所以每 只筷子必须由两位哲学家共享-dining philosophers problem in multithreaded how to avoid deadlock. Problem descr ipt
63535277productor
- 生产者消费者的JAVA代码,看有没有人需要用，或者大家发个哲学家进餐的代码共同研究！-producers and consumers of Java code, to see no one needs to use You made a philosopher dining code joint research!
VxWorksprogramme
- 摘 要:通过一个经典的多任务同步哲学家进餐问题。介绍了Vxworks下的多任务程序设计和任务间通信机制，并给出了运行的结果 -Abstract : Through a classic multi-task synchronization dining philosophers problem. Vxworks introduced under the multi-task design and process communicati
SimulationoftheDiningPhilosophersProblem
- 计算机仿真的实验，用三种方法模拟了哲学家进餐的过程，图形化的显示过程，用VC++.net开发的。-computer simulation experiments, using three methods to simulate the process of the Dining Philosophers, graphical display process, VC. net development.
emluatorofphilosopherdine
- 计算机仿真的实验，用三种方法模拟了哲学家进餐的过程，图形化的显示过程，用VC++.net开发的-computer simulation experiments, using three methods to simulate the process of the Dining Philosophers, graphical display process, VC. net development
process_tongbu
- 用win32函数，模拟了哲学家进餐问题，对于初学多线程编程的理解线程之间的同步和死锁问题很有启发性。-using win32 function to simulate the Dining Philosophers, For novice multithreaded programming understanding thread synchronization between the deadlock and very instruc
jincan
- 哲学家进餐问题 在多线程中如何避免死锁。 简单源码，有参考价自己 -dining philosophers problem in multithreaded how to avoid deadlock. Simple source, a reference price of its own
zhexue05
- 进程同步,哲学家进餐共享临界区变量.定义信号量机制控制进程不互斥!-process synchronization, philosopher dining area share critical variables. Definition signal to the process control mechanism not contradict!
operation
- c++实现的进程线程问题，包括父子进程，哲学家进餐问题等等.-c++ implementation of the process of threading issues, including his son process, the philosopher eating problems, and so.
chopsticktest
- 这是一个用多线程编写的哲学家进餐问题，里面用到了多线程中的一些知识。-This is a multi-threaded, prepared with the dining philosophers problem, which uses a multi-threaded some knowledge.
Dinning
- 这是用C++实现的著名的哲学家进餐问题。代码中含有被注释的部分中 可以解决哲学家进餐带来的死锁问题。请大家参考-The Dinning Philosophers Problem
cvery_3281411350
- 哲学家进餐问题 操作系统几天心血都在这里-operater system
Philosoper
- 哲学家进餐，进程同步问题，利用java语言实现的-Dining philosophers, process synchronization problem, the use of java language