对进程调度与作业调度的模拟,进程调度算法：采用的是最高优先数优先的高度算法（即把处理机分配给优先数最高的进程和先来先服务算法。分区分配和回收算法：采用首次适应算法和最佳适应算法实现动态分区。其中，空闲分区通过空闲分区链来管理，在进行内存分配时，系统优先使用空闲区低端的空间。-process of scheduling and job scheduling simulation and process scheduling algorithm : the highest priority is the high number of priority algorithm (that is, processors allocated to the highest priority to the process and the first-come first-serve count France. through distribution and recovery algorithm : the first and best adaptation algorithm to adapt to dynamic partitioning algorithm. Among them, through idle through to idle through chain management, carrying out memory allocation, the system priority in the use of low-end leisure area of space.