为了更充分的利用CPU，必须管理好进程内及进程间的调度关系，此实验就是模拟进程之间的调度方法。在实验中，只模拟了3个状态之间的调度过程，为了便于观察调度过程，我采用手动操作方式（即根据操作者输入的命令来做相应的转换）。在程序中，为进程建议一个结构体，以这种类型建立一个数组，用了存储所有进程信息；同时建议了两个先进先出的对列（ready,blocked）用来存储当前就绪的进程和等待资源的进程（在程序中这两个队列只是存储了进程在存储进程的数组的下标，用下标来作为唯一标识且访问，但是不是pid）。对列是自己写的结构，用一个数组来实现队列，其实是实现了循环队列。在用一个变量running(int)来表示当前运行的进程（当然，这里也是进程数组的下标）。当进程调度时，其进程状态也相应改变，只是对两个队列和running的操作,同时改变该进程的状态（state）。



关键字：操作系统 进程调度

-In order to more fully use the CPU, must manage the process and the process of scheduling inter-relations, this experiment is to simulate the process of scheduling between the methods. In the experiment, only three state simulation of the activation process between, in order to facilitate observation of the activation process, I used manual mode of operation (that is, operator input in accordance with an order to do the conversion). In the procedure for the process to recommend a structure to set up an array of this type, with all the process of information storage　also proposed for two out of the FIFO (ready, blocked) used to store the current process in place and the process of waiting for resources (in the process the two queues is stored in the storage process, the process of array subscr ipt, used as a subscr ipt uniquely identify and access, but not a pid). To write out the structure of their own, using an array to achieve the queue is a queue cycle. Using a variable in the runnin