Hai Wang^*, Xuan Hao, Shuo Ji^*, Jie Zheng, Yuhui Ma, Jianfeng Yang

Intelligent Automation & Soft Computing, Vol.37, No.2, pp. 1621-1635, 2023, DOI:10.32604/iasc.2023.037898 - 21 June 2023

Abstract Trusted Execution Environment (TEE) is an important part of the security architecture of modern mobile devices, but its secure interaction process brings extra computing burden to mobile devices. This paper takes open portable trusted execution environment (OP-TEE) as the research object and deploys it to Raspberry Pi 3B, designs and implements a benchmark for OP-TEE, and analyzes its program characteristics. Furthermore, the application execution time, energy consumption and energy-delay product (EDP) are taken as the optimization objectives, and the central processing unit (CPU) frequency scheduling strategy of mobile devices is dynamically adjusted according to the More >

Sardar Zafar Iqbal, Hina Gull^*, Saqib Saeed, Madeeha Saqib, Mohammed Alqahtani, Yasser A. Bamarouf, Gomathi Krishna, May Issa Aldossary

Computer Systems Science and Engineering, Vol.41, No.2, pp. 461-477, 2022, DOI:10.32604/csse.2022.017003 - 25 October 2021

Abstract Modern human life is heavily dependent on computing systems and one of the core components affecting the performance of these systems is underlying operating system. Operating systems need to be upgraded to match the needs of modern-day systems relying on Internet of Things, Fog computing and Mobile based applications. The scheduling algorithm of the operating system dictates that how the resources will be allocated to the processes and the Round Robin algorithm (RR) has been widely used for it. The intent of this study is to ameliorate RR scheduling algorithm to optimize task scheduling. We More >

Samih M. Mostafa^1,*, Sahar Ahmed Idris², Manjit Kaur³

CMC-Computers, Materials & Continua, Vol.70, No.3, pp. 6271-6288, 2022, DOI:10.32604/cmc.2022.021978 - 11 October 2021

Abstract Minimizing time cost in time-shared operating systems is considered basic and essential task, and it is the most significant goal for the researchers who interested in CPU scheduling algorithms. Waiting time, turnaround time, and number of context switches are the most time cost criteria used to compare between CPU scheduling algorithms. CPU scheduling algorithms are divided into non-preemptive and preemptive. Round Robin (RR) algorithm is the most famous as it is the basis for all the algorithms used in time-sharing. In this paper, the authors proposed a novel CPU scheduling algorithm based on RR. The… More >

Samih M. Mostafa^1,*, Hirofumi Amano²

CMC-Computers, Materials & Continua, Vol.66, No.3, pp. 3253-3270, 2021, DOI:10.32604/cmc.2021.014675 - 28 December 2020

Abstract CPU scheduling is the basic task within any time-shared operating system. One of the main goals of the researchers interested in CPU scheduling is minimizing time cost. Comparing between CPU scheduling algorithms is subject to some scheduling criteria (e.g., turnaround time, waiting time and number of context switches (NCS)). Scheduling policy is divided into preemptive and non-preemptive. Round Robin (RR) algorithm is the most common preemptive scheduling algorithm used in the time-shared operating systems. In this paper, the authors proposed a modified version of the RR algorithm, called dynamic time slice (DTS), to combine the… More >