Abstract
Asymmetric multi-core processors require careful assignment of tasks to the appropriate cores. Most of the edge computing devices are operated on Linux. However, the current Linux scheduler assigns tasks to cores without considering their capabilities. This can lead to high-priority tasks being assigned to energy-efficient cores while low-priority tasks are assigned to high-performance cores. This results in a decrease in the overall system performance. A new algorithm has been proposed to address this issue that considers the core’s capabilities and the task’s priority. This algorithm requires prior knowledge of the core’s speed due to the asymmetric nature of the cores. The priorities of the tasks are fetched, and then tasks are divided into high, medium, and low classes. High-priority tasks are scheduled on high-performance cores, while medium and low-priority tasks are scheduled on energy-efficient cores. The proposed algorithm performs better than the existing Linux task scheduling algorithm for high-priority tasks, improving task scheduling time by up to 16%.
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
Bender, M.A., Rabin, M.O.: Scheduling cilk multithreaded parallel programs on processors of different speeds. In: Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 13–21 (2000)
Bhadauria, M., McKee, S.A.: An approach to resource-aware co-scheduling for CMPS. In: Proceedings of the 24th ACM International Conference on Supercomputing, pp. 189–199 (2010)
Bienia, C., Kumar, S., Singh, J.P., Li, K.: The PARSEC benchmark suite: characterization and architectural implications. In: Proceedings of the 17th International Conference on Parallel Architectures and Compilation Techniques, pp. 72–81 (2008)
Bilbao, C., Saez, J.C., Prieto-Matias, M.: Rapid development of OS support with PMCSched for scheduling on asymmetric multicore systems. In: Singer, J., Elkhatib, Y., Blanco Heras, D., Diehl, P., Brown, N., Ilic, A. (eds.) Euro-Par 2022. LNCS, vol. 13835, pp. 184–196. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-31209-0_14
Cao, K., Liu, Y., Meng, G., Sun, Q.: An overview on edge computing research. IEEE Access 8, 85714–85728 (2020)
Chen, Q., Guo, M., Deng, Q., Zheng, L., Guo, S., Shen, Y.: HAT: history-based auto-tuning MapReduce in heterogeneous environments. J. Supercomput. 64, 1038–1054 (2013)
Chronaki, K., et al.: Task scheduling techniques for asymmetric multi-core systems. IEEE Trans. Parallel Distrib. Syst. 28(7), 2074–2087 (2016)
De Vuyst, M., Kumar, R., Tullsen, D.M.: Exploiting unbalanced thread scheduling for energy and performance on a CMP of SMT processors. In: Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, pp. 10-p. IEEE (2006)
Fahringer, T.: Optimisation: operating system scheduling on multi-core architectures. In: seminar Parallel Computing (2008)
Goel, S., Mikek, B., Aly, J., Arun, V., Saeed, A., Akella, A.: Quantitative verification of scheduling heuristics. arXiv preprint arXiv:2301.04205 (2023)
Guo, Y., Barik, R., Raman, R., Sarkar, V.: Work-first and help-first scheduling policies for ASYNC-finish task parallelism. In: 2009 IEEE International Symposium on Parallel & Distributed Processing, pp. 1–12. IEEE (2009)
Hofmeyr, S., Iancu, C., Blagojević, F.: Load balancing on speed. ACM Sigplan Not. 45(5), 147–158 (2010)
Janiak, A., Janiak, W.A., Krysiak, T., Kwiatkowski, T.: A survey on scheduling problems with due windows. Eur. J. Oper. Res. 242(2), 347–357 (2015)
Keckler, S.W., Hofstee, H.P., Olukotun, K.: Multicore Processors and Systems. Springer, New York (2009). https://doi.org/10.1007/978-1-4419-0263-4
Koufaty, D., Reddy, D., Hahn, S.: Bias scheduling in heterogeneous multi-core architectures. In: Proceedings of the 5th European Conference on Computer Systems, pp. 125–138 (2010)
Kuhn, D.: Investigation of the relation between the Linux operating system scheduler and scheduling decisions at thread and process level (2022)
Lee, H., Jung, S., Jo, H.: STUN: reinforcement-learning-based optimization of kernel scheduler parameters for static workload performance. Appl. Sci. 12(14), 7072 (2022)
McDougall, R., Mauro, J.: Solaris Internals: Solaris 10 and OpenSolaris Kernel Architecture (Paperback). Pearson Education (2006)
Saez, J.C., Prieto, M., Fedorova, A., Blagodurov, S.: A comprehensive scheduler for asymmetric multicore systems. In: Proceedings of the 5th European Conference on Computer Systems, pp. 139–152 (2010)
Salami, B., Noori, H., Naghibzadeh, M.: Online energy-efficient fair scheduling for heterogeneous multi-cores considering shared resource contention. J. Supercomput. 1–20 (2022)
Tam, D., Azimi, R., Stumm, M.: Thread clustering: sharing-aware scheduling on SMP-CMP-SMT multiprocessors. ACM SIGOPS Oper. Syst. Rev. 41(3), 47–58 (2007)
Torvalds, L.: Kernel code (2021). https://www.kernel.com
Torvalds, L.: Kernel documentation (2021). https://www.kernel.org/doc/readme/
Windows: Windows specification (2021). https://msdn.microsoft.com/en-us/library/windows/
Wong, C.S., Tan, I., Kumari, R.D., Wey, F.: Towards achieving fairness in the Linux scheduler. ACM SIGOPS Oper. Syst. Rev. 42(5), 34–43 (2008)
Xu, C., Lau, F.C.: Load Balancing in Parallel Computers: Theory and Practice, vol. 381. Springer, New York (1996). https://doi.org/10.1007/b102252
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 Switzerland AG
About this paper
Cite this paper
Hada, R.P.S., Srivastava, A. (2024). A Novel Priority Based Scheduler for Asymmetric Multi-core Edge Computing. In: Casteleyn, S., Mikkonen, T., García Simón, A., Ko, IY., Loseto, G. (eds) Current Trends in Web Engineering. ICWE 2023. Communications in Computer and Information Science, vol 1898. Springer, Cham. https://doi.org/10.1007/978-3-031-50385-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-031-50385-6_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-50384-9
Online ISBN: 978-3-031-50385-6
eBook Packages: Computer ScienceComputer Science (R0)