Boosted System Performance based on Execution Time Using LiMca Scheduling Algorithm

The scheduling algorithms have been examined by the process of task execution in a system to achieve maximum utilization of multiprocessors. Consequently, the research attempted to propose a new real-time scheduling algorithm to support a multiprocessor platform. The proposed scheduling algorithm, List Mcnaughton’s amalgamation (LiMca) scheduling algorithm has been developed for an optimum solution with the features of List and Mcnaughton’s scheduling algorithms to overcome the individual drawbacks (pre-emption and Precedence constraints). In LiMca, Workload has been distributed to the processors in a system by sorting the tasks in decreasing order with their precedence constraints including due dates, pre-emption, and context switching. In this arena, the LiMca scheduling algorithm has been developed on a traditional avionic mission system and also simulated on a real-time application. The extensive simulations were carried out on the time optimization of resources scheduling (TORSCHE) simulation toolbox. LiMca scheduling algorithm performed superior as compared to recently reported scheduling algorithms like list, hu’s, McNaughton’s, Brucker’s, and Hodgson’s in terms of computational performance.

Download Full-text

Energy-Efficient Real-Time Scheduling Algorithm for Fault-Tolerant Autonomous Systems

Scalable Computing Practice and Experience ◽

10.12694/scpe.v19i4.1438 ◽

2018 ◽

Vol 19 (4) ◽

pp. 387-400

Author(s):

Hussein El Ghor ◽

Julia Hage ◽

Nizar Hamadeh ◽

Rafic Hage Chehade

Keyword(s):

Energy Consumption ◽

Real Time ◽

Integrated Circuit ◽

Energy Efficient ◽

Fault Tolerant ◽

Scheduling Algorithm ◽

Autonomous Systems ◽

Scheduling Algorithms ◽

Real Time Scheduling ◽

Time Scheduling

For the past decades, we have experienced an aggressive technology scaling due to the tremendous advancements of Integrated Circuit technology. As massive integration continues, the power consumption of the IC chips exponentially increases which further degraded the system reliability. This in turn poses significant challenges to the design of real-time autonomous systems. In this paper, we target the problem of designing advanced real-time scheduling algorithms that are subject to timing, energy consumption and fault-tolerant design constraints. To this end, we first investigated the problem of developing scheduling techniques for uniprocessor real-time systems that minimizes energy consumption while still tolerating up to k transient faults to preserve the system's reliability. Two scheduling algorithms are proposed: the first scheduler is an extension of an optimal fault-free energy-efficient scheduling algorithm, named ES-DVFS. The second algorithm aims to enhance the energy saving by reserving adequate slack time for recovery when faults strike. We derive a necessary and sufficient condition that must be efficiently checked for the time and energy feasibility of aperiodic jobs in the presence of failures. Later, we formally prove that the proposed algorithm is optimal for a k-fault-tolerant model. Our simulation results demonstrate that the proposed schedulers can efficiently improve energy savings when compared with previous works.

Download Full-text