Dependency-Aware Task Allocation Algorithm for Distributed Edge Computing

To overcome the limitation of standalone edge computing in terms of computing power and resource, a concept of distributed edge computing has been introduced, where application tasks are distributed to multiple edge clouds for collaborative processing. To maximize the effectiveness of the distributed edge computing, we formulate an optimization problem of task allocation minimizing the application completion time. To mitigate high complexity overhead in the formulated problem, we devise a low-complexity heuristic algorithm called dependency-aware task allocation algorithm (DATA). Evaluation results demonstrate that DATA can reduce the completion time up to by 18% compared to conventional dependency-unaware task allocation schemes.