使用动态优先权的进程调度算法的模拟（Simulation of process scheduling algorithm using dynamic priority）.docVIP

使用动态优先权的进程调度算法的模拟（Simulation of process scheduling algorithm using dynamic priority） Experiment 1 Simulation of process scheduling algorithm using dynamic priority 1 objective of experiment The understanding of process concept and process scheduling process is deepened by simulation of dynamic priority algorithm. 2 experiment content (1) the process scheduling of dynamic priority priority algorithm for N processes is implemented. (2) each process control block PCB used to mark the process is described by a structure, including the following fields: Process identifier number ID. Process priority number PRIORITY, and the greater the priority number of the process, the higher the priority. CPU time CPUTIME occupied by process. The CPU time needed for the process is ALLTIME. When the process is finished, ALLTIME changes to 0. The blocking time of the process is STARTBLOCK, which means that when the process is running STARTBLOCK time slices, it will enter the blocking state. The process blocked time BLOCKTIME, indicating the blocked process, and then wait for BLOCKTIME time slice, will be converted to a ready state. Process state STATE. The queue pointer, NEXT, is used to queue PCB. (3) the principle of the change of priority number: The process stays in the ready queue for one time slice, with the priority number plus 1. For each time slice of the process, the number of priority is reduced by 3. (4) assume that there are 5 processes in the system before scheduling, and their initial states are as follows: ID 01234 PRIORITYCPUTIME 00000 ALLTIME 33634 STARTBLOCK 2-1 -1 -1 -1 BLOCKTIME 30000 STATE ready ready ready ready ready (5) in order to clearly observe the scheduling process of each process, the program should display the situation in each time slice, and refer to the specific format as follows: RUNNING PROG:i READY-QUEUE:-id1-id2 BLOCK-QUEUE:-id3-id4 = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = ID 01234 PRIORITY P0 P1 P2 P3