Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alameddine, H.A., Sharafeddine, S., Sebbah, S., Ayoubi, S., Assi, C.: Dynamic task offloading and scheduling for low-latency IoT services in multi-access edge computing. IEEE J. Sel. Areas Commun. 37(3), 668–682 (2019)
Lin, K., Lin, B., Chen, X., Lu, Y., Huang, Z., Mo, Y.: A time-driven workflow scheduling strategy for reasoning tasks of autonomous driving in edge environment. In: 2019 IEEE International Conference on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom), pp. 124–131. IEEE (2019)
Alsurdeh, R., Calheiros, R.N., Matawie, K.M., Javadi, B.: Hybrid workflow provisioning and scheduling on cooperative edge cloud computing. In: 2021 IEEE/ACM 21st International Symposium on Cluster, Cloud and Internet Computing (CCGrid), pp. 445–454. IEEE (2021)
Xu, X., Cao, H., Geng, Q., Liu, X., Dai, F., Wang, C.: Dynamic resource provisioning for workflow scheduling under uncertainty in edge computing environment. Concurrency Comput. Pract. Experience 34(14), e5674 (2022)
Li, H., Ota, K., Dong, M.: Learning IoT in edge: deep learning for the internet of things with edge computing. IEEE Network 32(1), 96–101 (2018)
Stojmenovic, I., Wen, S., Huang, X., Luan, H.: An overview of fog computing and its security issues. Concurrency Comput. Pract. Experience 28(10), 2991–3005 (2016)
Aljumah, A., Ahanger, T.A.: Fog computing and security issues: a review. In: 2018 7th International Conference on Computers Communications and Control (ICCCC), pp. 237–239. IEEE (2018)
Ferrag, M.A., Derhab, A., Maglaras, L., Mukherjee, M., Janicke, H.: Privacy-preserving schemes for fog-based IoT applications: Threat models, solutions, and challenges. In: 2018 International Conference on Smart Communications in Network Technologies (SaCoNeT), pp. 37–42. IEEE (2018)
Wangsom, P., Lavangnananda, K., Bouvry, P.: Multi-objective scientific-workflow scheduling with data movement awareness in cloud. IEEE Access 7, 177063–177081 (2019)
Liu, J., Pacitti, E., Valduriez, P., Mattoso, M.: A survey of data-intensive scientific workflow management. J. Grid Comput. 13, 457–493 (2015)
Zheng, W., Tang, L., Sakellariou, R.: A priority-based scheduling heuristic to maximize parallelism of ready tasks for DAG applications. In: 2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, pp. 596–605. IEEE (2015)
Topcuoglu, H., Hariri, S., Wu, M.Y.: Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Syst. 13(3), 260–274 (2002)
Malewicz, G., Foster, I., Rosenberg, A.L., Wilde, M.: A tool for prioritizing DAGMan jobs and its evaluation. J. Grid Comput. 5(2), 197–212 (2007)
Cordasco, G., Rosenberg, A.L., D’Ambra, P., Guarracino, M., Talia, D.: Area-maximizing schedules for series-parallel DAGs. In: Euro-Par (2), pp. 380–392 (2010)
Zheng, W., Zhang, X., Tang, L., Zhang, D., Chen, J.: An adaptive priority-based heuristic approach for scheduling DAG applications with uncertainties. In: 2017 IEEE International Symposium on Parallel and Distributed Processing with Applications and 2017 IEEE International Conference on Ubiquitous Computing and Communications (ISPA/IUCC), pp. 72–79. IEEE (2017)
Zhang, X., Zhang, D., Zheng, W., Chen, J.: An enhanced priority-based scheduling heuristic for DAG applications with temporal unpredictability in task execution and data transmission. Futur. Gener. Comput. Syst. 100, 428–439 (2019)
Hammouti, S., Yagoubi, B., Makhlouf, S.A.: Workflow security scheduling strategy in cloud computing. In: Chikhi, S., Amine, A., Chaoui, A., Saidouni, D.E., Kholladi, M.K. (eds.) MISC 2020. LNNS, vol. 156, pp. 48–61. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-58861-8_4
Abazari, F., Analoui, M., Takabi, H., Fu, S.: Mows: multi-objective workflow scheduling in cloud computing based on heuristic algorithm. Simul. Model. Pract. Theory 93, 119–132 (2019)
Wen, Y., Liu, J., Dou, W., Xu, X., Cao, B., Chen, J.: Scheduling workflows with privacy protection constraints for big data applications on cloud. Futur. Gener. Comput. Syst. 108, 1084–1091 (2020)
Stavrinides, G.L., Karatza, H.D.: Security and cost aware scheduling of real-time IoT workflows in a mist computing environment. In: 2021 8th International Conference on Future Internet of Things and Cloud (FiCloud), pp. 34–41. IEEE (2021)
Lin, L., Liao, X., Jin, H., Li, P.: Computation offloading toward edge computing. Proc. IEEE 107(8), 1584–1607 (2019). https://doi.org/10.1109/JPROC.2019.2922285
Guo, S., Liu, J., Yang, Y., Xiao, B., Li, Z.: Energy-efficient dynamic computation offloading and cooperative task scheduling in mobile cloud computing. IEEE Trans. Mob. Comput. 18(2), 319–333 (2018)
Cordasco, G., De Chiara, R., Rosenberg, A.L.: Assessing the computational benefits of area-oriented DAG-scheduling. In: Euro-Par (1), pp. 180–192 (2011)
Kashyap, R., Vidyarthi, D.P.: Security driven scheduling model for computational grid using NSGA-II. J. Grid Comput. 11, 721–734 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Hong, Y., Wang, C., Zheng, W. (2024). Privacy-Aware Scheduling Heuristic Based on Priority in Edge Environment. In: Tari, Z., Li, K., Wu, H. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2023. Lecture Notes in Computer Science, vol 14490. Springer, Singapore. https://doi.org/10.1007/978-981-97-0859-8_17
Download citation
DOI: https://doi.org/10.1007/978-981-97-0859-8_17
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-97-0858-1
Online ISBN: 978-981-97-0859-8
eBook Packages: Computer ScienceComputer Science (R0)