Efficient constraint handling during designing reliable automotive real-time systems

  • Authors:
  • Florian Pölzlbauer;Iain Bate;Eugen Brenner

  • Affiliations:
  • Virtual Vehicle, Graz, Austria;Department of Computer Science, University of York, York, United Kingdom;Institute for Technical Informatics, Graz University of Technology, Graz, Austria

  • Venue:
  • Ada-Europe'12 Proceedings of the 17th Ada-Europe international conference on Reliable Software Technologies
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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.