Execution Strategies for PTIDES, a Programming Model for Distributed Embedded Systems

Authors:
Jia Zou;Slobodan Matic;Edward A. Lee;Thomas Huining Feng;Patricia Derler
Affiliations:
-;-;-;-;-
Venue:
RTAS '09 Proceedings of the 2009 15th IEEE Symposium on Real-Time and Embedded Technology and Applications
Year:
2009

Citing 0
Cited 6

PTIDES on flexible task graph: real-time embedded systembuilding from theory to practice

Proceedings of the 2009 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
A hybrid approach to cyber-physical systems verification

Proceedings of the 49th Annual Design Automation Conference
Co-design of control and platform with dropped signals

Proceedings of the ACM/IEEE 4th International Conference on Cyber-Physical Systems
A synchronous embedding of Antescofo, a domain-specific language for interactive mixed music

Proceedings of the Eleventh ACM International Conference on Embedded Software
Building timing predictable embedded systems

ACM Transactions on Embedded Computing Systems (TECS)
A unified execution model for multiple computation models of streaming applications on a composable MPSoC

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a family of execution policies for a programming model called PTIDES (Programming Temporally Integrated Distributed Embedded Systems). A PTIDES application (factory automation, for example) is given as a discrete-event (DE) model of a distributed real-time system that includes sensors and actuators. The time stamps of DE events are bound to physical time at the sensors and actuators, turning the DE model into an executable specification of the system with explicit real-time constraints. This paper first defines a general execution strategy that conforms to the DE semantics, and then specializes this strategy to give practical, implementable and distributed policies. Our policies leverage network time synchronization to eliminate the need for null messages, allow independent events to be processed out of time stamp order, thus increasing concurrency and making more models feasible (w.r.t. real-time constraints), and improve fault isolation in distributed systems. The policies are given in terms of a safe to process predicate on events that depends on the time stamp of the events and the local notion of physical time. In a simple case we show how to statically check whether program execution satisfies timing constraints.