搜索资源列表
UcosiiAppliction
- 任务一 任务管理 任务二 优先级天花板 任务三 哲学家就餐 任务四 消息队列 任务五 时钟中断-task of a task management tasks two priority tasks ceiling three meals philosopher four tasks Message Queue five tasks Clock interruption
zhexuejia
- 计算机操作系统哲学家就餐问题的课程设计报告。无解压密码。-computer operating system dining philosophers problem of the design report. No extract passwords.
Viston
- 本程序将ucosii移入了QF框架，使其成为面向对象的操作系统，可以在win32上运行，这是一个“哲学家就餐”的demo程序-This procedure will ucosii into the fr a mework of the QF, making it object-oriented operating system, can run on win32, it is a
zhe
- 进程同步算法模拟，哲学家就餐问题JAVA实现。-Process synchronization algorithm simulation, philosophers realize JAVA eat.
aaaaaaaaaaaaaa
- htt哲学家就餐-htt dining philosophers
PHI
- 哲学家就餐问题，显示线程的关系，采用信号量产生互斥的功能-Dining philosophers problem, show the relationship between threads, using semaphore have mutually exclusive features
UcOS2_Philosopher
- 这个程序演示基本的哲学家就餐问题的解决。程序启动具有五个不同优先级的任务，每个任务对应一个哲学家，完成一系列动作-err
jiucan
- 关于哲学家就餐的问题,这只是个源码,我想要个课程设计形式的-On the dining philosophers, which is only a source, I want a form of curriculum design
eat
- 用c语言实现了操作系统中的哲学家就餐问题,可以参考-C language used in the operating system to achieve the dining philosophers problem, can refer to
DINING
- 演示哲学家就餐 进程的同步与互斥-Demo dining philosophers process synchronization and mutual exclusion
zhexuejia
- linux用多线程同步方法解决哲学家就餐问题(Dining-Philosophers Problem)-linux using multi-thread synchronization methods to solve the problem dining philosophers (Dining-Philosophers Problem)
philosopher
- 经典的哲学家就餐问题的C语言版本-Power wilt die of hunger laugh mold cavity open string问Questions cavity C Pang Sung-linked版
ucos-dining-philosopher
- ucos-dining-philosopher.rar ucos下的哲学家就餐问题（dining philosopher problems)，采用信号量机制解决，有截图和感悟。dos界面文字演示（另有图形界面）。-ucos-dining-philosopher.rarucos under the dining philosophers problem (dining philosopher problems), using sema
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,
philosopheDining
- 死锁--哲学家就餐问题.完整源码,并可直接运行.-Deadlock- dining philosophers problem. Complete source code can be run directly.
PhilosopherDining
- 在 WINDOWS 系统中实现哲学家就餐问题的死锁和不死锁两种解法。-WINDOWS system to achieve in the dining philosophers problem of deadlock and deadlock two solution.
dining
- 哲学家就餐问题C语言演示程序，带窗口、对话框，有详细中英文注释-Dining philosophers problem of C language demo program with a window, dialog box, there are detailed notes in English and Chinese
ConsoleApplicationforEat0207
- 操作系统中的哲学家就餐问题模拟系统。命令行程序。c#实现。运行需要.NET fr a mework 2.0。另有可视化界面程序。-Operating system in the dining philosophers problem simulation system. Command-line program. c# implementation. Required to run. NET fr a mework 2.0. Anoth
Dining_philosophers
- 用VC实现的哲学家就餐问题，其中用到了信号量的宏，并多线程的方法，模拟哲学家就餐问题。-Implementation using VC dining philosophers problem, use one of the semaphore macros, and multi-threaded approach, Analog dining philosophers problem.
frfs
- 读者写者问题，哲学家就餐问题，先来先来先服务-Writing questions from readers, dining philosophers problem, first-come, first-come, first serve