Privacy-Aware Scheduling Heuristic Based on Priority in Edge Environment

The need for edge computing has been increasing recently with the rise of the Internet of Things (IoT). This leads to an urgent demand for suitable scheduling strategies in the edge computing environment. However, edge nodes are more vulnerable to privacy breaches. Thereby, workflow scheduling algorithms in edge computing systems are required to fully consider privacy issues. Additionally, edge applications usually desire real-time responsiveness. So makespan is also an important quality of service (QoS) metric considered in edge environments. This paper proposes a privacy-aware and priority-based algorithm (PAPBS) based on the dynamic priority-based heuristic (PB) to address privacy issues and real-time scheduling problems in edge environments. The proposed approach aims at minimizing application completion time while satisfying privacy task scheduling requirements. Extensive simulation experiments have been conducted to compare our approach with other related scheduling algorithms. The results showed that our proposed algorithm outperforms its competitors on makespan while satisfying privacy scheduling requirements.