▍1. 可变分区
说明: 可变分区,一个很重要的操作系统原代码,很详细的拉,个人下载参考参考。(Variable Division, a very important source operating system, a very detailed and pulling personal information. Download.)
说明: 可变分区,一个很重要的操作系统原代码,很详细的拉,个人下载参考参考。(Variable Division, a very important source operating system, a very detailed and pulling personal information. Download.)
这是我写的一个关于操作系统的FIFO的过程,希望大学在使用的同时指出不足之处,(This the one I wrote on the operating system FIFO process, in the hope that the University of noted deficiencies, thank you)
内存静态分配: 程序还有一些错误,益出处理不知道怎么加入。此程序开始不是我写的的,我在别人的基础上理解并改动了一些。实验课已经结束了,没时间在做了,以后有机会再改。(static memory allocation : there are some procedural error, derived from processing do not know how to join. This is not the beginning of the proceedings I write, I others on the basis of understanding and change some of it. Experiments over, and no time to do in the future will have the opportunity to change.)
操作系统之采用最优分配算法分配xk大小的空间(operating system using optimal allocation algorithm xk size distribution space)
模拟操作系统进程调度的算法采用时间片轮转法和优先权法(operating system simulation process scheduling algorithm-time Web-law and law priority)
这是一个利用DOC操作系统编写的GUI系统(This is a use of DOC prepared by the operating system GUI System)
信号量实现临界区访问(signal to achieve critical visit)
银行家算法,希望大家喜欢(bankers algorithm, hope you like)
采用首次适应法、最佳适应法或最差适应法,编写一内存分配和回收模拟程序。 动态地随机产生新的“内存分配”或“内存回收”请求,再按照你选定的分配算法修改这个数组。由于这个实验的重点在于内存分配,所以不考虑与某内存区相关的进程情况。(used first to adapt, adapt best or the worst adaptation law, the preparation of a memory allocation and recovery simulation program. Dynamic random to create a new "memory allocation" or "memory recovery" request, then you have chosen in accordance with the allocation algorithm to change the array. As the focus of this experiment is memory allocation, it is not considered relevant to a certain memory area of the process.)