From Logical Time Scheduling to Real-Time Scheduling - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2018

From Logical Time Scheduling to Real-Time Scheduling

Abstract

Scheduling is a central yet challenging problem in real-time embedded systems. The Clock Constraint Specification Language (CCSL) provides a formalism to specify logical constraints of events in real-time embedded systems. A prerequisite for the events is that they must be schedulable under constraints. That is, there must be a schedule which controls all events to occur infinitely often. Schedulability analysis of CCSL raises important algorithmic problems such as computational complexity and design of efficient decision procedures. In this work, we compare the scheduling problems of CCSL specifications to the real-time scheduling problem. We show how to encode a simple task model in CCSL and discuss some benefits and differences compared to more classical scheduling strategies.
No file

Dates and versions

hal-01971976 , version 1 (07-01-2019)

Identifiers

  • HAL Id : hal-01971976 , version 1

Cite

Frédéric Mallet, Min Zhang. From Logical Time Scheduling to Real-Time Scheduling. 39th IEEE Real-Time Systems Symposium, Dec 2018, Nashville, United States. ⟨hal-01971976⟩
81 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More