Fig. 4
From: An energy saving based on task migration for mobile edge computing
Fine-grained directed acyclic graph task topology model. It is a topological model of a fine-grained directed acyclic graph task topology. A directed acyclic graph (DAG) is used to represent the complex dependencies among subtasks. For the graph G, G = (V, E), the node set V represents the task set to be processed, v ∈ V represents the divided subtask, E represents the directed edge set, represents the dependencies between the tasks, and euv ∈ E represents the amount of transfer data between the task u and the task v, which represents when the task u is finished, euv data is transmitted to task v, task v can start execution only after task u is executed