Execution-time aware Simulink blocks

Authors:
Andreas Naderlinger
Affiliations:
University of Salzburg
Venue:
Proceedings of the 2012 SpringSim Poster & Work-In-Progress Track
Year:
2012

Citing 2
Cited 1

Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications

Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Automatic Code Generation for Synchronous Reactive Communication

ICESS '09 Proceedings of the 2009 International Conference on Embedded Software and Systems

Multiple real-time semantics on top of synchronous block diagrams

Proceedings of the Symposium on Theory of Modeling & Simulation - DEVS Integrative M&S Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes works in progress. We present the concept of a Simulink block that is not characterized by the typical zero execution time behavior. Instead, the execution of such blocks lasts for a finite amount of simulation time and may span several simulation steps. We are able to schedule a set of such execution-time aware blocks with a static priority approach and show preemption effects already in the simulation.