application bankers algorithm to solve deadlock

操作系统的应用。-OS applications.

微操作系统（c＋＋）-Micro-operating system (c )

操作系统--文件管理-operating system-- Document Management

一个好好银行家算法-a good banker"s algorithm

操作系统银行家算法原代码-operating system bankers algorithm source code

资源描述 免费开源广告联盟系统 免费开源广告联盟系统 免费开源广告联盟系统 免费开源广告联盟系统 免费开源广告联盟系统 免费开源广告联盟系统 免费开源广告联盟系统 免费开源广告联盟系统

哈工大的几个人开发的操作系统pyos的部分源码-the development of several people pyos part of the operating system source code

LRU(最近最少使用算法) and MRU(最近最常使用算法)所谓的LRU(Least recently used)算法的基本概念是:当内存的剩余的可用空间不够时,缓冲区尽可能的先保留使用者最常使用的数据,换句话说就是优先清除”较不常使用的数据”,并释放其空间-LRU (least recently used algorithm) and MRU (most recently used) algorithm called LRU ( Least recently used) algorithm is the basic concept : When the memory of the remaining available space is insufficient, the first buffer as possible to retain the most common users of the data used, In other words priority is to eliminate the "more rarely use the data," and the release of its space

进程调度演示程序-process scheduling Demonstration Program.

设计一个有N个进程并发的进程调度程序。 进程调度算法：采用最高优先数优先的调度算法（即把处理机分配给优先数最高的进程）算法。 -Design of a concurrent process, N a process scheduler. The process of scheduling algorithm: The number of priority the highest priority scheduling algorithm (ie the number of processors allocated to the highest priority to the process) algorithm.