Concurrent models of computation for embedded software

Lee, Edward; Neuendorffer, Stephen

doi:10.1049/pbcs018e_ch7

Cited by 8 publications

(7 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We argue that the notions of concurrency and time are the most critical elements in the design and implementation of an embedded autonomous space system. According to a study on concurrent models of computation for embedded software by Lee and Neuendorffer (2005), the major contributing factors to the development and design complexity of such systems are the underlying sequential memory models and the lack of first class representation of the notions of time and concurrency in the applied programming languages.…”

Section: Analysis and Resultsmentioning

confidence: 99%

Design and application of distributed containers in a CPS software control library

Dechev

LaBorde

2015

IJSETA

View full text Add to dashboard Cite

Non-blocking synchronisation is known to alleviate the hazards of deadlock, livelock, and priority inversion. We present the design and portable implementation of a lock-free dynamically resizable array. Our lock-free implementation of a shared vector outperforms its lock-based STL counterpart and the implementation provided by Intel by a factor of 10 or more. The ABA problem is fundamental to all CAS-based designs. We offer a solution, called the λδ approach that is practical and efficient and offers speeds comparable to the direct application of the architecture-specific CAS2 instruction used for version counting. Our lock-free vector demonstrated high scalability when compared to the application of non-blocking transactions. We demonstrate the use of our non-blocking synchronisation methodology and our shared vector for the engineering of a framework for verification and semantics parallelisation of the mission data system's (MDS) goal networks which provide for testing and development of autonomous real-time flight applications.

show abstract

Section: Analysis and Resultsmentioning

confidence: 99%

Design and application of distributed containers in a CPS software control library

Dechev

LaBorde

2015

IJSETA

View full text Add to dashboard Cite

show abstract

“…Model-based design is a well-tested approach for the implementation of these systems. A comprehensive survey on concurrent models of computation can be found in [11]. Prior research has shown that dataflow and its variants are sufficiently expressive enough to capture the task and data parallelism in streaming applications.…”

Section: Related Workmentioning

confidence: 99%

Static dataflow with access patterns

Ghosal

Limaye

Ravindran

et al. 2012

Proceedings of the 49th Annual Design Automation Conference

View full text Add to dashboard Cite

Signal processing and multimedia applications are commonly modeled using Static/Cyclo-Static Dataflow (SDF/CSDF) models. SDF/CSDF explicitly specifies how much data is produced and consumed per firing during computation. This results in strong compile-time analyzability of many useful execution properties such as deadlock absence, channel boundedness, and throughput. However, SDF/CSDF is limited in its ability to capture how data is accessed in time. Hence, using these models often leads to implementations that are sub-optimal (i.e., use more resources than necessary) or even incorrect (i.e., use insufficient resources). In this work, we advance a new model called Static Dataflow with Access Patterns (SDF-AP) that captures the timing of data accesses (for both production and consumption). This paper formalizes the semantics of SDF-AP, defines key properties governing model execution, and discusses algorithms to check these properties under correctness and resource constraints. Results are presented to evaluate these analysis algorithms on practical applications modeled by SDF-AP.

show abstract

“…Temporal recursion is a style of timedriven, discrete-event concurrency [6,24] similar to Engines [20,21] with real-time interrupt scheduling.…”

Section: Concurrencymentioning

confidence: 99%

Programming with time

SorensenAndrew

Gardner

2010

SIGPLAN Not.

View full text Add to dashboard Cite

The act of computer programming is generally considered to be temporally removed from a computer program's execution. In this paper we discuss the idea of programming as an activity that takes place within the temporal bounds of a real-time computational process and its interactions with the physical world. We ground these ideas within the context of livecoding -a live audiovisual performance practice. We then describe how the development of the programming environment "Impromptu" has addressed our ideas of programming with time and the notion of the programmer as an agent in a cyber-physical system.

show abstract

Concurrent models of computation for embedded software

Cited by 8 publications

References 19 publications

Design and application of distributed containers in a CPS software control library

Design and application of distributed containers in a CPS software control library

Static dataflow with access patterns

Programming with time

Contact Info

Product

Resources

About