forth

说明：  模拟操作系统进程调度(先来先服务，优先级优先，相应比优先，最短作业优先），资源抢夺，内存分配功能（动态分区，静态分区）（最坏适应法，最佳适应法，FIFO）(Simulation operating system process scheduling (first come first serve, priority first, corresponding ratio first, shortest job first), resource grabbing, memory allocation function (dynamic partition, static partition) (worst adaptation, best adaptation, FIFO))

请求分页存储管理方式的模拟实现，包括相应的说明文件(request tabbed storage management methods to achieve the simulation, including the corresponding notes)

说明：  这是我们学习操作系统的时候老师给我们做的关于进程调度的实验，很经典，给大家参考一下！(This is our time for teachers to learn the operating system for us to do experiments on the process of scheduling, it is a classic look for your reference!)

采用首次适应法、最佳适应法或最差适应法，编写一内存分配和回收模拟程序。 动态地随机产生新的“内存分配”或“内存回收”请求，再按照你选定的分配算法修改这个数组。由于这个实验的重点在于内存分配，所以不考虑与某内存区相关的进程情况。(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.)

完全BIOS手册，开发BIOS的人员可以参考作为入门。(BIOS HandBook)

操作系统概念一书第七版中用到的源码，包括project等等。(Source codes for book Operating System Concepts, including projects in this book and so on)

clock页面置换算法 用CLOCK置换算法仿真请求分页系统 1、设计目的：用高级语言编写和调试一个内存分配程序，加深对内存分配算法的理解。 2、设计要求： 1) 实现请求分页存储管理方式的页面置换算法：CLOCK算法 2) 内存物理块数固定为15个，对多个作业采用可变分配全局置换的策略分配物理块 3) 作业数量与作业大小（10-20页）可在界面进行设置 4) 所有作业按RR算法进行调度，时间片长度为1秒 5) 可为每个作业随机产生引用的页面串，也可以人工输入引用的页面串，页面串长度50---100，要求必须包括作业所有的页面，可作为样例数据保存 6) 可读取样例数据（要求存放在外部文件中）进行作业数量、作业大小、页面串长度的初始化 7) 要求采用可视化界面，模拟内存分配和使用情况图，可在运行过程中随时暂停，查看当前内存物理块使用情况。 8) 每次全部作业运行结束后，要求打印出访问命中率 (clock page replacement algorithm)

linux ０．１１内核源代码分析Ｖ２．０版 为Ｖ１．０版的修正版　(linux 0.11 kernel source code analysis V2.0 version V1.0 version of the amended version of)

支持可信启动链，支持TPM/TCM。在GRUB的stage1, stage1.5, stage2对关键加载数据进行扫描，并记录到TPM/TCM芯片中。需要BIOS提供0x1A中断实现。(supports trusted booting, support TPM/TCM。This software measures key data in stage1, stage1.5, stage2, and record into TPM/TCM chip. needs 0x1A interrupt functions implemented in BIOS.)

1）设计一程序，由一个进程创建三个子进程，三个子进程一个是生产者进程，两个是消费者进程。 2）父子进程都使用父进程创建的共享存储区进行通信，由生产者进程将一个数组中的十个数值发送到由5个缓冲区组成的共享内存中。? 3）两个消费者进程轮流接收并输出这十个数值，同时将两个消费者进程读出的数值进行累加求各和。 4）考虑生产者进程生产的速度和消费者进程速度。(1) a program is designed to create three sub processes from one process, three sub processes is the producer process, and the two is the consumer process. 2) the father child process communicates with the shared storage area created by the parent process, and sends ten values in one array to the shared memory composed of 5 buffers by the producer process. L 3) the two consumer processes take turns to receive and output the ten values, and add values to each of the two consumer processes. 4) take into account the production speed of the producer process and the speed of the consumer process.)