Task Scheduling for Edge Computing with Agile VNFs On-Demand Service Model toward 5G and Beyond

Algorithm 1

Greedy Available Fit algorithm.

Input: , t_i, d_i, j

Output:

(1) Start

(2) Set the largest task d_i as the baseline of the scheduler

(3) for to n //initialize the maximum N at time 0 to be zero for each service

  request in queue

(4) 

(5) for to   //determine the maximum N obtained by R₁ at each time step

(6)  if ((j == t₁) and (j <= d₁))

(7)   

(8)  else

(9)     =

(10) for to n

(11)  for to

(12)   if (j > d_i) // case (1): the current time step j already exceeds ’s deadline

(13)    then

(14)   else if (j < t_i) // case (2): there is not enough time to finish request R_i by the

    current time j

(15)    then

(16)   else // case (3): time j does not exceed ’s deadline, and there is enough time

    to finish request by time j

(17)    then

(18) Schedule Completed

(19) End