Introduction - If you have any usage issues, please Google them yourself
Design a number of priority scheduling algorithm processor scheduling procedures
Hint:
( 1 ) assumes that the system has five processes, each with a PCB to represent . PCB in the format:
Process name , pointer, required running time, priority number , status.
Process Name- P1 ~ P5.
Pointer- the size of the number of priority 5 into Cheng Liancheng queue , using a pointer that the next process, the first address of the PCB .
The time required to run- assuming unit time required to run the process number .
Priority number- number of priority given to the process , always select a priority when scheduling a large number of processes executed first .
State- assuming two states , Ready, represented by R , and the end , with the E said . The initial state is the ready state .
( 2 ) Before each run , for each process arbitrarily determined its " priority number " and " run-time requirements ."
( 3 ) processor always choose the first team to run the process . Dynamic way to change th