Flashcards
EMBEDDED
Cards in this deck (21)
- 1FSM with hierarchyFSMs components inside a larger FSM
- 2deterministicone choice, not two lines for same input
- 3ReceptiveDoes not get stuck
- 4Extended FSM
- 5Side by side composition
- 6Cascade composition
- 7Deepest refinement first, FSM
- 8Preemtive transition, FSM reset transition
- 9history tranistion, FSM
- 10SDF, Synchronous Dataflowassumes that all actors in the system consume and produce a constant number of tokens at each of their ports whenever they fire, i.e. make a step. This permits full analysis of the buffer sizes required for deadlock-free execution, as well as complete compile-time (static) scheduling of the sequences of actors firings, the resulting buffer sizes, as well as the access patterns to the buffers.
- 11Dynamic Dataflow (DDF)makes no assumptions about the rates with which actors produce and consume tokens, and in fact allows them to be variable and dependent on the data and the state of an actor. As a result, it is in general undecidable whether a DDF network will deadlock or be able to execute within a finite amount of (buffer) space. However, there are ways of scheduling its actors in such a way that the result will be an execution in finite amount of space, if such an execution exists.
- 12Algorithm for finding well formed, and also defintion of well formed but not constructive
- 13ill formed and well formed
- 14Timed models, Time triggered MoCs, Discrete event systems, Continuous time systems
- 15Many processes, ALAP, ASAP
- 16Earliest Due Date Earliest Deadline First Latest Deadline First
- 17Rate monotonic
- 18List Scheduling, example of one priority
- 19Kernighan Lin partitioning, heuristic (may not be the optimal) https://www.youtube.com/watch?v=6cPql7A6JHU&ab_channel=profmadden
- 20Logic operators explain: G, F, X, U
- 21operators : FG(p), GF(p)
Information
- Description
- Flashcards on EMBEDDED, created by Fabian Eklund Sigleifs on 16/05/2023.
- Created by
- Fabian Eklund Sigleifs
- Views
- 6
- Rating