Research Article

TPD: Temporal and Positional Computation Offloading with Dynamic and Dependent Tasks

Algorithm 1

Critical task first (CTF) algorithm.
Input:Information about tasks, edge servers, and IoT devices
Output: Offloading strategy with minimized
1 Put tasks into three types of queues according to task status. Use the BCN method to mark the criticality of tasks. Sort ready tasks from high to low according to criticality. all tasks in ready queue do
2  for all in do
3   Calculate and on
4  end
5  Choose the edge server with the smallest Calculate and on local IoT device < then
6   , ,
7  end
8  else
9   , ,
10  end
11 end
12 Go back to step 2 when a new task or new ready task is generated.