dos

驱动调度+操作系统+模拟电梯调动的算法程序，使用C++编写。(Driven scheduling algorithm procedures, the+ operating system+ simulated lift mobilize written using the C++.)

处理及调度源代码，用C++来编程，模拟处理机调度，实验报告(Processing and scheduling source code, using C++, programming, analog processor scheduling, lab reports)

说明：  ucos2 vc++移植代码 通过VC++编译，每2S显示一次任务(ucos2 vc++ code migration)

FP-growth算法的改进C++程序,具有较好的扩展性和应用性,本程序改成用行读取，然后在内存中解析。更有效的方式是采用块读取方式（本人在以前项目中验证过，速度大为提高。）(FP-growth algorithm C++ Procedures, have good scalability and application, the procedure changed to use line to read, and then resolve in memory. More effective approach is the use of block-read mode (I tested before the project, speed greatly improved.))

模拟段式存储管理的分配与回收，能够输入给定的内存大小，进程的个数，每个进程的段数及段大小；当某进程提出申请空间的大小后，显示能否满足申请，以及为该进程分配资源后有关内存空间使用的情况。 (Analog-stage distribution of storage management and recovery, be able to enter a given memory size, number of processes, each process segment number and segment size when a space the size of the application process, the show can meet the application, as well as the The process, after the allocation of resources relating to the use of memory space.)

说明：  用标准C实现shell功能,是操作系统的作业，Linux里面的she(Shell to achieve using standard C function, the operation is the operating system, Linux inside she)

说明：  消费代码.用于操作系统中的课程设计使用.愿大家提供建议我也好改进算法(Consumer code. For the operating system to use the curriculum design. I would like to provide recommendations to improve the algorithm or)

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 number in operation during the entire process will not change. priority number in the designated input data, can be reached under the order, running time determine. b) dynamic priority number refers to several priorities for the process of the creation process can be given an initial value, and according to the principle of amending certain priority number.)

1．虚拟存储器的引入 局部性原理：程序在执行时在一较短时间内仅限于某个部分；相应的，它所访问的存储空间也局限于某个区域，它主要表现在以下两个方面：时间局限性和空间局限性。 2．虚拟存储器的定义 虚拟存储器是只具有请求调入功能和置换功能，能从逻辑上对内存容量进行扩充的一种存储器系统 (1. The introduction of virtual memory locality principle: program execution in a relatively short period of time limited to a particular part of it Accordingly, it has access to the storage space is also limited to a particular region, it is mainly manifested in the following two aspects: the time limitations and space limitations. 2. The definition of virtual memory Virtual memory is just a request for redeployment of functions and displacement functions, from the logical to expand the memory capacity of a memory system)

这个程序是模拟采用二级目录结构的磁盘文件系统中的文件操作，它可以实现对文件的一些基本管理，如：读、写、删除文件等。通过这个程序可掌握文件子系统的原理，加深对二级目录结构的文件系统中用户管理、文件管理、目录管理的理解，并用程序实现对文件子系统的模拟。(the procedure is simulated using two disk directory structure of the file system file manipulation, it can be achieved on some basic document management, such as : read, write, delete files. Through this procedure can grasp the principle document subsystems to enhance the structure of the two file system user management, document management, directory management, understanding, and the procedures to achieve the right documents subsystem simulation.)