Introduction - If you have any usage issues, please Google them yourself
Let RQ be divided into RQ1 and RQ2, RQ1 using rotary method, the time q = 7.
RQ1> RQ2, RQ2 priority scheduling algorithm using a short process.
Test data are as follows: RQ1: P1-P5, RQ2: P6-P10
Process P1 P2 P3 P4 P5 P6 P7 P8 P9 P10
Running time 1,611,141,315,211,810,714
Have waiting time 6543212345
Implementation description:
typedef struct tag_pcb
{Char name [8]
int need // required run time
int turn // turnaround time
struct tag_pcb* next
} PCB
PCB* RQ1,* RQ2
int clock = 0 // Clock
main ()
{Input RQ1
Enter RQ2 (best read from the file)
while (RQ1! = NULL)