Alla Abbas Khadir¹, Seyed Amin Hosseini Seno^1,2,*, Baydaa Fadhil Dhahir^2,3, Rahmat Budiarto⁴

Computer Systems Science and Engineering, Vol.45, No.2, pp. 2223-2234, 2023, DOI:10.32604/csse.2023.032316 - 03 November 2022

Abstract Fog computing became a traditional OffLad Destination (OLD) to compute the offloaded tasks of the Internet of Vehicles (IoV). Nevertheless, the limited computing resources of the fog node leads to re-offload these tasks to the neighboring fog nodes or the cloud. Thus, the IoV will incur additional offloading costs. In this paper, we propose a new offloading scheme by utilizing RoadSide Parked Vehicles (RSPV) as an alternative OLD for IoV. The idle computing resources of the RSPVs can compute large tasks with low offloading costs compared with fog nodes and the cloud. Finally, a performance More >

Fengxiang Zhang^∗

Computer Systems Science and Engineering, Vol.34, No.4, pp. 171-178, 2019, DOI:10.32604/csse.2019.34.171

Abstract This paper addresses a number of mathematical issues related to multiprocessor global EDF platforms. We present a deadline-d all busy period and backward interference which are important concepts for multiprocessor EDF systems, and some general schedulability conditions for any studied job are proposed. We formally prove that at most m-1 different tasks’ jobs could contribute their execution time to an interval starting with a P_busy−d, and we propose an approach for computing an exact upper bound of the total deadline-d task load in a given interval. Therefore, the proposed results are important foundations for constructing exact More >

Vidblain Amaro-Ortega^1,∗, Arnoldo Díaz-Ramírez², Brenda Leticia Flores-Ríos¹, Félix Fernando González-Navarro¹, Frank Werner³, Larysa Burtseva¹

Computer Systems Science and Engineering, Vol.33, No.1, pp. 31-40, 2018, DOI:10.32604/csse.2018.33.031

Abstract The Linux operating system has been employed to execute numerous real-time applications. However, it is limited to support soft real-time systems by two scheduling policies: First-In-First-Out and Round Robin. For real-time systems with critical constraints, the soft real-time support and these scheduling policies are still insufficient. In this work, the Earliest Deadline First scheduling policy, which has been shown in theory to be an optimal one in uniprocessor systems, is introduced as an extension of the Linux kernel. This policy is implemented into the real-time class, without the necessity of defining an additional class. The More >