Description: Write and debug a simulation of the process scheduler, using the "highest priority number priority" scheduling process scheduling algorithm to five.
The "highest priority number first" scheduling algorithm the basic idea is to CPU allocated to the highest-priority ready queue in the process. Static priority number is determined when creating the process, and in the whole process will not change during the operation.
Dynamic priority number refers to the process of creating a process priority number can be given an initial value, and can modify the priority number according to certain principles. For example: access to a CPU in the process after one of its priority to reduce the number of, or the process to wait longer than a certain time limit, increase the number of its priority value, and so on.
To Search:
File list (Check if you may need any files):
FIRST1.C
Download