Description: To write and debug a simulated process scheduler, the " number of the highest priority " scheduling algorithm of N (N is not less than 5) process scheduling. " The highest priority number priority scheduling algorithm' s basic idea is that the CPU is allocated to the highest priority number of processes in the ready queue. (1) the static priority number to determine when the process is created, and no longer changes during the run of the entire process. (2) the dynamic priority number refers to the number of priority of the process can create a process to set an initial value, and you can modify certain rules priority number. For example: In the process of time the CPU after the decrease in its priority number 1, and process wait time exceeds a certain time limit (two-chip time) to increase its priority number. (3) (**) the number of the priority of the process and the operating time can be required prior to artificially designated (can also be generated by a ra
To Search:
File list (Check if you may need any files):
ProcScheduling.pdf
Download