Efficient constraint handling during designing reliable automotive real-time systems

4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In modern embedded systems, e.g. avionics and automotive, it is not unusual for there to be between 40 and 100 processors with a great deal of the software having hard real-time requirements and constraints over how, when and where they execute. The requirements and constraints are essential to the overall systems dependability and safety (e.g. to ensure replicas execute on different hardware). This leads to a complex design space exploration (DSE) problem which cannot be practically solved manually especially if the schedule is to be maintained. In this paper it is shown that dealing with the constraints using a conventional state of the art "System Configuration Algorithm" is less efficient, less effective and does not scale well. This issue can be improved by performing constraint pre-processing as well as constraint encoding. It is shown that our approach can handle typical industrial requirements that come from the automotive industry's AUTOSAR standard in an efficient way. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Pölzlbauer, F., Bate, I., & Brenner, E. (2012). Efficient constraint handling during designing reliable automotive real-time systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7308 LNCS, pp. 207–220). https://doi.org/10.1007/978-3-642-30598-6_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free