Latency-Aware Computation Offloading for 5G Networks in Edge Computing

Algorithm 1

Shortest time-to-completion first EFP.

	Inputs: G = (T, DP), M, ri,j, fi, , Li
	Output: Decision (i)
(1)	i = 0
(2)	for i = 0 to M do
(3)	Compute the prior values of each subtask ti,j according to formula (17)
(4)	end for
(5)	non-increasing sorting of the prior values of all subtasks
(6)	while existing subtasks that have not confirmed scheduling strategies
(7)	Select the subtask ti,j with the highest priority
(8)	Computing the EFT(j) of the task according to formula (7)
(9)	if EFT(j)local < EFT(j)edgeand < Li
(10)	The subtask ti,j still executed locally
(11)	else
(12)	Offload ti,j to edge server
(13)	end if
(14)	end while