+文本文档（+ text document）.doc

+文本文档（+ text document） Arena emergency) experiment: Simulation of dynamic priority process scheduling algorithm 1. experimental purposes Through the simulation of dynamic priority scheduling algorithm, deepen the understanding of the concept of the process. 2. experiment content (1) using C language to realize the process scheduling of N process using dynamic priority algorithm. (2) each process control block PCB used to identify the process is described by its structure, including the following fields: Process identifier number ID The process priority number PRIORITY, and the greater the number of priority process, the higher the priority. The process has occupied CPU time CPUTIME. The process also takes up CPU time ALLTIME, and when the process is finished, ALLTIME is 0. The blocking time of the process is STARTBLOCK, which means that when the process is running again STARTBLOCK time slices, the process will enter a blocking state. The time that the process is blocked is BLOCKTIME, indicating the blocked process, and then waiting for the BLOCKTIME time slice to be converted to a ready state. Process status STATE. The queue pointer, NEXT, is used to group the PCB into queues. (3) the principle of priority change The process stays in the ready queue for one time slice, with a 1 increase in priority. Each time the process runs, the number of priority is reduced by 3. (4) assume that before scheduling, there are 5 processes in the system, and their initial state is as follows: ID 01234 PRIORITYCPUTIME 00000 ALLTIME 33634 STARTBLOCK 2-1, -1, -1, -1 BLOCKTIME 30000 STATE is READY (5) in order to clearly observe the scheduling process of each process, the program should display the process of each time slice, and refer to the specific format as follows: RUNNING PROG: I READY_QUEUE:-id1-id2 BLOCK_QUEUE:-id3-id4 /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////