A Smart Semipartitioned Real-Time Scheduling Strategy for Mixed-Criticality Systems in 6G-Based Edge Computing

Algorithm 1

Schedulablity analysis.

Inputs:

 Task set to be partitioned T = ,...,;

 Processors set to be allocated .

Outputs:

 PT = Que_Ready_,...,Que_Ready_.

 /where Que_Ready_ is the tasks ready queue on ./

1: for each in Pdo

2: Set Que_Ready_ = {};

3: end for

4: Sorted according to priority in descending

5: for each in do

6: Calculate R_i by Eq. (3);

7: for each p_j in P by descending order do

8:  ifR_i ≤ D_ithen

9:   Add τ_i into Que_Ready_p_j;

10:   break;

11:  end if

12: end for

13: end for

14: returnPT;