Evaluation of the Fault-Tolerant Online Scheduling Algorithms for CubeSats - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2020

Evaluation of the Fault-Tolerant Online Scheduling Algorithms for CubeSats

Abstract

Small satellites, such as CubeSats, have to respect time, spatial and energy constraints in the harsh space environment. To tackle this issue, this paper presents and evaluates two fault tolerant online scheduling algorithms: the algorithm scheduling all tasks as aperiodic (called ONEOFF) and the algorithm placing arriving tasks as aperiodic or periodic tasks (called ONEOFF&CYCLIC). Based on several scenarios, the results show that the performances of ordering policies are influenced by the system load and the proportions of simple and double tasks to all tasks to be executed. The "Earliest Deadline" and "Earliest Arrival Time" ordering policies for ONEOFF or the "Minimum Slack" ordering policy for ONEOFF&CYCLIC reject the least tasks in all tested scenarios. The paper also deals with the analysis of scheduling time to evaluate real-time performances of ordering policies and shows that ONEOFF requires less time to find a new schedule than ONEOFF&CYCLIC. Finally, it was found that the studied algorithms perform well also in a harsh environment.
Fichier principal
Vignette du fichier
2020_DSD_v_HAL.pdf (281.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02927553 , version 1 (01-09-2020)

Identifiers

  • HAL Id : hal-02927553 , version 1

Cite

Petr Dobiáš, Emmanuel Casseau, Oliver Sinnen. Evaluation of the Fault-Tolerant Online Scheduling Algorithms for CubeSats. DSD 2020 - 23rd EUROMICRO Conference on Digital System Design, Aug 2020, Portoroz, Slovenia. pp.1-11. ⟨hal-02927553⟩
30 View
114 Download

Share

Gmail Facebook X LinkedIn More