Fault-Tolerant Online Scheduling Algorithms for CubeSats - Archive ouverte HAL Access content directly
Conference Papers Year :

Fault-Tolerant Online Scheduling Algorithms for CubeSats

(1) , (1) , (2)
1
2

Abstract

CubeSats are small satellites operating in harsh space environment. In order to ensure correct functionality on board despite faults, fault tolerant techniques taking into account spatial, time and energy constraints should be considered. This paper presents a software-level solution taking advantage of several processors available on board. Two online scheduling algorithms are introduced and evaluated. The results show their performances and the trade-off between the rejection rate and energy consumption. Last but not least, it is stated that ordering policies achieving low rejection rate when using the algorithm scheduling all tasks as aperiodic are the "Earliest Deadline" and "Earliest Arrival Time". As for the algorithm treating arriving tasks as aperiodic or periodic tasks, the "Minimum Slack" ordering policy provides reasonable results.
Fichier principal
Vignette du fichier
2020_PARMA_DITAM.pdf (428.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02461164 , version 1 (30-01-2020)

Identifiers

  • HAL Id : hal-02461164 , version 1

Cite

Petr Dobiáš, Emmanuel Casseau, Oliver Sinnen. Fault-Tolerant Online Scheduling Algorithms for CubeSats. PARMA-DITAM’20 - 11th Workshop on Parallel Programming and Run-Time Management Techniques for Many-core Architecture, 9th Workshop on Design Tools and Architectures for Multicore Embedded Computing Platforms, Jan 2020, Bologna, Italy. ⟨hal-02461164⟩
57 View
156 Download

Share

Gmail Facebook Twitter LinkedIn More