对学习操作系统的运行原理有很大帮助，必不可多得的内部文档...

windows系统内存动态存储分配，两种分配算法-windows system memory dynamic storage allocation, the two allocation algorithm

一个小型操作系统原码,有详细的注释和制作过程,非常适合初学者学习!-a small original operating system code, a detailed Notes and the manufacturing process, are very suitable for beginners learning!

动态分区存储管理方式的主存分配回收。存储管理中动态分区的管理方式，编写程序完成动态分区存储管理方式的主存分配回收的实现。实验具体包括：首先确定主存空间分配表；然后采用最优适应算法完成主存空间的分配，完成主存空间的回收；最后编写主函数对所作工作进程测试。存分配时查找空闲区进行分配，然后填写已分配区表，主要操作在空闲区-dynamic storage management through the distribution of the main deposit recovery. Dynamic Storage Management Division"s management style and preparation procedures are completed through dynamic storage management of main memory allocated to achieve recovery. Experiments including : first to identify the main deposit space allocation table; Then using the optimal algorithm to adapt to the completion of main memory space allocated main memory space complete recovery; Final preparation of the main function of the work done by the process of testing. When you deposit allocated for distribution free zone, and then fill in forms have been allocated to the district, mainly operating in the district idle

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

设备管理主要包括设备的分配和回收、同时实现设备独立性。假定模拟系统中有A（3台）、B（2台）、C三种设备，采用安全分配方式。-Device Manager includes equipment distribution and recovery, while achieving device independence. Simulation system assumes that there are A (3 units), B (2 units), C three kinds of equipment, the introduction of safety distribution.

account manager 帐户管理，管理个人常用的账号信息。-account manager account management, management of personal account information commonly used.

操作系统内存调度例子-operating system memory scheduling example

操作系统中读者写者问题-readers to write operating system problem

环形队列，经过测试通过，很好用，可以增加，可以减少,FIFO-Circular queue, after the test is passed, good use can be increased, can be reduced, FIFO

1、 ：编写并调试一个模拟的进程调度程序，采用“最高优先数优先”调度算法对进程进行调度。 “最高优先数优先调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。尝试静态优先数与动态优先数两种方法： a) 静态优先数是指优先数在整个进程运行期间不再改变。优先数可以在数据输入时指定，也可以根据到达顺序、运行时间确定。 b) 动态优先数是指进程的优先数在创建进程时可以给定一个初始值，并且可以按一定原则修改优先数。例如进程获得一次CPU后就将其优先数减少1。或者进程等待的时间超过某一时限时增加其优先数的值。 2、 编写并调试一个模拟的进程调度程序，模拟实现多级反馈队列调度算法。 3、 编写并调试一个模拟的进程调度程序，模拟实现最低松弛度优先算法。 4、 程序与报告要求： a) 对上述要求1、2、3，至少要完成一项，鼓励尝试多种算法。 b) 输出结果要尽量详细清晰，能够反映调度后队列变化，PCB内部变化。 c) 可以选择在Windows或Linux环境下编写、运行程序 d) 鼓励使用不同的开发工具在不同平台环境上进行开发比较。 e) 在实验报告中，一方面可以对实验结果进行分析，一方面可以对各种算法进行比较，分析它们的优劣，说明各种算法适用于哪些情况下的调度。 -1 : Prepare a simulation and debugging process scheduling procedures, "Priority number of the highest priority" to the process of scheduling algorithms for scheduling. "Highest priority priority scheduling algorithm for the basic idea is to place the CPU allocated to the priority queue highest process. Taste Examination several static and dynamic priority priority number two methods : a) static priority number is priority