搜索资源列表
200811182357586855
- 一群哲学家围坐在一个圆桌，手上持有密码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
002
- 一群哲学家围坐在一个圆桌，手上持有密码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
food
- 哲学家进餐问题 操作系统的几大代码之一-Dining philosophers problem of operating system, one of several major code
dining
- 哲学家就餐问题C语言演示程序，带窗口、对话框，有详细中英文注释-Dining philosophers problem of C language demo program with a window, dialog box, there are detailed notes in English and Chinese
philosopher
- 哲学家就餐问题的实现，进程死锁问题，PV原语-Philosophers eat the realization of the process of deadlock, PV primitives
deadlock
- 操作系统课程设计：死锁问题。 哲学家进餐问题的解决！！！很好的操作系统大作业！-Operating systems curriculum design: Deadlock problem. Dining philosophers problem! ! ! Very good major operating system!
philosopher
- 哲学家进餐问题是荷兰学者Dijkstra 提出的经典问题之一,它是一个信号量机制问题的应用,在操作系统文化史上具有非常重要的地位。对该问题的剖析有助于学生深刻地理解计算机系统中的资源共享、进程同步、死锁等问题,并能熟练地应用信号量来解决生活中的控制流程,即将生活中的控制流程用形式化的方式表达出来。-Dining philosophers problem is that the Dutch scholars Dijkstra classi
multithreadingjava
- 鈥?What Is a Thread? o The Thread Class o Simple Thread Examples 鈥?Problems with Multithreading o What Goes Wrong? o Thread Names and Current Threads o Java s synchronized 鈥?Synchronizing Threads o
ex3
- 哲学家就餐问题的实现！是使用信号量实现的，有利于ucos的学习-Implementation of the dining philosophers problem! Is to use semaphore implementation, and is conducive to learning uCOS
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
PE0213
- 操作系统中的哲学家就餐问题模拟系统。可视化界面程序。c#实现。运行需要.NET fr a mework 2.0。另有命令行程序。-Operating system in the dining philosophers problem simulation system. Visualization interface procedures. c# implementation. Required to run. NET fr a mew
Dining_Philosophers
- 英国帝国理工学院电脑系多线程课程教学材料之八 ---- 哲学家晚餐范例-Five philosophers sit around a circular table. Each philosopher spends his life alternatively thinking and eating. In the centre of the table is a large plate of spaghetti. A philosoph
Fixed_Dining_Philosophers
- 英国帝国理工学院电脑系多线程课程教学材料之九 ---- 哲学家晚餐范例（无死锁，需要引用到原问题的部分代码）-The version avoids the possibility of deadlock by making even numbered philosophers pick up the chopsticks in a different order from the rest. That is, left first ra
Philosopher
- 哲学家就餐问题MFC演示程序，生动说明了这个问题-Dining philosophers problem MFC demo program
Dining_philosophers
- 用VC实现的哲学家就餐问题，其中用到了信号量的宏，并多线程的方法，模拟哲学家就餐问题。-Implementation using VC dining philosophers problem, use one of the semaphore macros, and multi-threaded approach, Analog dining philosophers problem.
Philosopher
- 操作系统中经典的哲学家进餐问题，使用VC6.0可以进行编译-Operating system in the classic dining philosophers problem, use the VC6.0 compiler can
philosopher
- 基于UCOS2开源的程序，描述了操作系统里经典的哲学家就餐问题，很好的实现了进程的实时控制，实现了进程同步 -UCOS2 procedures based on open source, describes the operating system in the classic dining philosophers problem, a very good implementation of the process of real-t
Philosopher
- 关于操作系统哲学家进餐的动态演示程序，清晰的分析了死锁发生的情形和修正死锁。-Dining philosophers about the operating system dynamic presentation procedures, a clear analysis of the deadlock situation occurred and amendments to deadlock.
frfs
- 读者写者问题，哲学家就餐问题，先来先来先服务-Writing questions from readers, dining philosophers problem, first-come, first-come, first serve
Diningphilosophersproblem
- 哲学家进餐问题假如所有的哲学家都同时拿起左侧筷子，看到右侧筷子不可用，又都放下左侧筷子， 等一会儿，又同时拿起左侧筷子，如此这般，永远重复。对于这种情况，即所有的程序都在 无限期地运行，但是都无法取得任何进展，即出现饥饿，所有哲学家都吃不上饭。-Dining philosophers problem