Skip to Main content Skip to Navigation
Conference papers

Fault-Tolerant Online Scheduling Algorithms for CubeSats

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-02461164
Contributor : Emmanuel Casseau <>
Submitted on : Thursday, January 30, 2020 - 2:50:32 PM
Last modification on : Friday, November 20, 2020 - 11:44:04 AM

File

2020_PARMA_DITAM.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02461164, version 1

Citation

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⟩

Share

Metrics

Record views

121

Files downloads

409