hpa48

MFC实现的，界面有好，实现了进程调度的算法 能够模拟操作系统的进程调度 适合初学者(MFC implementation, the interface is good, a process scheduling algorithm to achieve To simulate the operating system process scheduling for beginners)

说明：  可变分区，一个很重要的操作系统原代码，很详细的拉，个人下载参考参考。(Variable Division, a very important source operating system, a very detailed and pulling personal information. Download.)

广东工业大学计算机学院操作系统4源代码 (Guangdong University of Computer Science 4 source code operating system)

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

作业调度程序，模拟操作系统的作业调度过程，协调和控制各个作业对cpu的使用控制(Job scheduling program to simulate the process of the operating system job scheduling, coordinating and controlling the use of control operations on cpu)

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.)

说明：  这是操作系统中调度算法中时间片轮转算法完成后的实践报告(This is the operating system scheduling algorithm in the time slice cycle after the completion of practice report)

pcb实现。。进程管理。就绪队列，阻塞队列实现(pcb to achieve)

计科操作系统课程“读者写者”问题的经典解决。(Branch of the operating system programs, " wrote the reader" as a problem to solve classic.)

模拟段式存储管理的分配与回收，能够输入给定的内存大小，进程的个数，每个进程的段数及段大小；当某进程提出申请空间的大小后，显示能否满足申请，以及为该进程分配资源后有关内存空间使用的情况。 (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.)