Description: The basic idea of the highest priority priority scheduling algorithm is assigned to the CPU ready queue with the highest priority process static priority is to determine when the process is created, and no longer changes during the run of the entire process.
Dynamic priority when the process is created, the priority of the process can be given an initial value, and can modify the priority of certain principles. For example: In the process of time the CPU after the decrease in its priority 1, or, process wait time exceeds a certain time limit, increase the priority value, and so on.
To Search:
File list (Check if you may need any files):
jinchengdiaodu.doc
Download