Simulated process scheduling

Simulate process scheduling , At least achieve 3 Scheduling algorithms ,

Scheduling algorithm ： First come, first served , Short job preferred , priority + Time slice rotation

Output process scheduling sequence All processes are scheduled , Output average waiting time and average weighted turnaround time

$$ Average weighted turnaround time = \frac{1}{ Number of assignments } \cdot \sum\frac{ When the homework is finished - Homework arrival time }{ Service time } $$ Write code in the specified file （ You can add functions to the file by yourself ）：

In the file exp8_process_schedule/process_schedule.h Definition PCB、 Process creation 、 Scheduling, etc ;

In the file process_schedule.c Implementation of process scheduling simulation operation ;

The test file test_data_5.csv and test_data_200.csv（ Actual test , You can take tests with fewer processes first test_data_5.csv, Ensure that the result is consistent with the logical result , Then test with more processes ）, The format is as follows ：

Log in and copy

      
      

       
       pid,arrive_time,run_time,priority
       
       
1,5,7,3
       
       
2,3,7,1
       
       
3,3,6,3
       
       
4,4,3,1
       
       
5,2,9,2
      
      
      
      

       
       
1.
       
       
2.
       
       
3.
       
       
4.
       
       
5.
       
       
6.
      
      

Log in and copy

      
      

       
       int main() {
       
       
 
       
       
  int n, t = 1;
       
       
  int proNum, choice;
       
       
  PCB pro[MAXSIZE], temp_pro[MAXSIZE];
       
       

       
       
  printf("\n\n\t\t\t\t\t<<------------- Process initialization ----------——>>\n");
       
       
  
       
       
  proNum = init_process(test_data1, pro);
       
       

       
       
  for (int i = 0; i < proNum; i++)
       
       
  {
       
       
    char tmp[256] = { 0 };
       
       

       
       
    printf("\n%s,%d,%d,%d\n", pro[i].name, pro[i].arrivetime, pro[i].running_time ,pro[i].priority);
       
       
  }
       
       
  printf("proNum %d\n", proNum);
       
       
  while (t) {
       
       
    menu();
       
       
    memcpy(temp_pro, pro, (sizeof(pro) / sizeof(pro[0])) * sizeof(PCB));
       
       
    scanf("%d", &n);
       
       
    while (n <= 0 || n > 5) {
       
       
      printf("\t\t\t Incorrect instruction , Please re-enter the instruction ： ");
       
       
      scanf("%d", &n);
       
       
    }
       
       
    switch (n) {
       
       
    case 1: {
       
       
      fifo(temp_pro, proNum);
       
       
      break;
       
       
    }
       
       
    case 2: {
       
       

       
       
      sjf(temp_pro, proNum);
       
       
      break;
       
       
    }
       
       
    case 3: {
       
       
      hpf(temp_pro, proNum);
       
       
      break;
       
       
    }
       
       
    case 4: {
       
       
      rr(temp_pro, proNum);
       
       
      break;
       
       
    }
       
       
    case 5: {
       
       
      t = 0;
       
       
      break;
       
       
    }
       
       
    }
       
       
    getchar();
       
       
    printf("\n\t Press any key to continue .......");
       
       
    getchar();
       
       
    system("cls");
       
       
  }
       
       
  system("cls");
       
       
  printf("\n\n\t\t\t\t\t You have successfully exited the system  q==610098308\n");
       
       

       
       
   return EXIT_SUCCESS;;
       
       
}
      
      
      
      

       
       
1.
       
       
2.
       
       
3.
       
       
4.
       
       
5.
       
       
6.
       
       
7.
       
       
8.
       
       
9.
       
       
10.
       
       
11.
       
       
12.
       
       
13.
       
       
14.
       
       
15.
       
       
16.
       
       
17.
       
       
18.
       
       
19.
       
       
20.
       
       
21.
       
       
22.
       
       
23.
       
       
24.
       
       
25.
       
       
26.
       
       
27.
       
       
28.
       
       
29.
       
       
30.
       
       
31.
       
       
32.
       
       
33.
       
       
34.
       
       
35.
       
       
36.
       
       
37.
       
       
38.
       
       
39.
       
       
40.
       
       
41.
       
       
42.
       
       
43.
       
       
44.
       
       
45.
       
       
46.
       
       
47.
       
       
48.
       
       
49.
       
       
50.
       
       
51.
       
       
52.
       
       
53.
       
       
54.
       
       
55.
       
       
56.
       
       
57.
       
       
58.
      
      

Code sorting ;