Dynamic scheduling of real-time tasks under precedence constraints
Real-Time Systems
Synchronous programming with events and relations: the SIGNAL language and its semantics
Science of Computer Programming
Comparing models of computation
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Theories of programming languages
Theories of programming languages
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Types and programming languages
Types and programming languages
Synchronous Programming of Reactive Systems
Synchronous Programming of Reactive Systems
Giotto: A Time-Triggered Language for Embedded Programming
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
POSIX-Compatible Application-Defined Scheduling in MaRTE OS
ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
Synchronous Distribution of SIGNAL Programs
HICSS '96 Proceedings of the 29th Hawaii International Conference on System Sciences Volume 1: Software Technology and Architecture
Cheddar: a flexible real time scheduling framework
Proceedings of the 2004 annual ACM SIGAda international conference on Ada: The engineering of correct and reliable software for real-time & distributed systems using Ada and related technologies
N-synchronous Kahn networks: a relaxed model of synchrony for real-time systems
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Translating discrete-time simulink to lustre
ACM Transactions on Embedded Computing Systems (TECS)
Automatic rate desynchronization of embedded reactive programs
ACM Transactions on Embedded Computing Systems (TECS)
EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
Sustainable Scheduling Analysis
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
A Framework for Distributing Real-Time Functions
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
A Multi-Periodic Synchronous Data-Flow Language
HASE '08 Proceedings of the 2008 11th IEEE High Assurance Systems Engineering Symposium
Scheduling Dependent Periodic Tasks without Synchronization Mechanisms
RTAS '10 Proceedings of the 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium
Programming parallelism with futures in lustre
Proceedings of the tenth ACM international conference on Embedded software
Design of safety-critical Java level 1 applications using affine abstract clocks
Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems
Buffer minimization in earliest-deadline first scheduling of dataflow graphs
Proceedings of the 14th ACM SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems
End-to-end latency computation in a multi-periodic design
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Explicit precedence constraints in safety-critical Java
Proceedings of the 11th International Workshop on Java Technologies for Real-time and Embedded Systems
Synchronous programming in audio processing: A lookup table oscillator case study
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
This article presents a complete scheme for the integration and the development of multi-periodic critical embedded systems. A system is formally specified as a modular and hierarchical assembly of several locally mono-periodic synchronous functions into a globally multi-periodic synchronous system. To support this, we introduce a real-time software architecture description language, named Prelude, which is built upon the synchronous languages and which provides a high level of abstraction for describing the functional and the real-time architecture of a multi-periodic control system. A program is translated into a set of real-time tasks that can be executed on a monoprocessor real-time platform with an on-line priority-based scheduler such as Deadline-Monotonic or Earliest-Deadline-First. The compilation is formally proved correct, meaning that the generated code respects the real-time semantics of the original program (respect of periods, deadlines, release dates and precedences) as well as its functional semantics (respect of variable consumption).