DE102018203501A1 - Method and device for processing a task by an embedded system - Google Patents

Abstract

Method (10) for processing a task (A, B) by an embedded system,
characterized by the following features:
- until the task (A, B) is completed, data are generated by a plurality of software components (4) dealing with the task (A, B) (1, 11),
the data are visualized for software components (4) dealing with other tasks (A, B) after completion of the task (A, B) (2, 12) and
the data is exchanged directly among the software components (4) dealing with task (A, B) (5, 13).

Description

The present invention relates to a method for processing a task by an embedded system. The present invention also relates to a corresponding device, a corresponding computer program and a corresponding storage medium.

State of the art

In highly automated driving (HAF), an intermediate step between assisted driving in which the driver is assisted by numerous (often separate) driver assistance systems in the driving task and autonomous driving, in which the vehicle is self-propelled and autonomous without driver intervention.

DE102014213245A1 describes a method for processing data for a highly automated driving function of a vehicle, in which a predetermined number of computing units is provided, wherein the computing units supply redundant data to a decision unit, the decision unit decides depending on a comparison of the data supplied by the computing units, whether the Data are correct and a synchronization unit synchronizes the arithmetic units in such a way that they deliver the data in a fixed period of time to the deciding unit and tells the deciding unit when the data is sent by the arithmetic units, so that the deciding unit can determine which data of the arithmetic units for a verification of the data will be used.

Disclosure of the invention

The invention provides a method for processing a task by an embedded system, a corresponding device, a corresponding computer program and a corresponding storage medium according to the independent claims.

The inventive approach is based on the finding that systems for highly automated driving are technically complex. This also applies to future robotics systems. They require a high computing power and a large memory and have compared to conventional systems significantly increased security requirements. The necessary consideration of the functional safety requirements thus additionally increases the system complexity.

The proposed method also takes into account the fact that today's systems in the automotive environment are often designed as directly communicating applications or components. Data is immediately made available to other applications at the time of its availability. The exact temporal relationship of the individual applications can often not be specified exactly for technical reasons, z. As there are significantly fewer independent computing cores available than applications that are to be operated on these cores. For this reason, it is difficult to predict when data will be sent exactly. From the point of view of the receiving applications, this leads to a data age dependent on the actual execution time and thus largely unpredictable.

An advantage of the solution described below, in contrast, lies in the deterministic behavior of the system operated in this way, which thus meets increased safety requirements. Further advantages can be seen in the reduction of the development effort or the efficiency increase in the reproduction of states. These advantageous properties are achieved by a combination of the synchronization of both input and output data.

For this purpose, during the execution of a task by means of temporally successive applications or components, the outputs of the applications or components that were running earlier are to be made available to the later running applications directly and not only in the next task cycle. The said determinism is ensured in this way, since the applications or components are executed sequentially.

mit n ∈ ℕ aufweisen.The measures listed in the dependent claims advantageous refinements and improvements of the independent claim basic idea are possible. Thus, it can be provided to integrate the individual tasks in a higher-level grid, consisting for example of a cycle of the largest possible period T and other cycles, the periods of $\frac{T}{2^n}$

with n ∈ ℕ.

The determined determinism decisively facilitates the development, since it is now clear for given input data which application receives which data.

In addition to the simplified development is hereby also a clear simulation is possible.

list of figures

• 1 das Flussdiagramm eines Verfahrens gemäß einer ersten Ausführungsform.
• 2 exemplarisch die Abarbeitung zweier Aufgaben durch mehrere Softwarekomponenten.
• 3 schematisch ein Steuergerät gemäß einer zweiten Ausführungsform.

Embodiments of the invention are illustrated in the drawings and explained in more detail in the following description. It shows:

• 1 the flowchart of a method according to a first embodiment.
• 2 exemplarily the execution of two tasks by several software components.
• 3 schematically a control device according to a second embodiment.

Embodiments of the invention

1 illustrates the basic sequence of a method according to the invention ( 10 ), which is now based on the exemplary execution of two tasks ( A, B ) based on 2 is explained in detail. It is understood that this representation is to be regarded as purely exemplary, since in a practical application, rather hundreds of tasks should be processed by means of the presented approach. The in this 2 emblematic applications or components ( 4 ) output data and can in turn release it from other components ( 4 ) received. The data output ( 1 ) is on the right side of the respective component ( 4 ), the data input on the left side. Time progresses from left to right according to the illustration.

A basic idea of the proposed method ( 10 ) consists in the synchronization of the input data z. B. for the realization of a redundant computer network such that the inputs of all applications or components ( 4 ) within the time slice of a task ( A, B ) at the beginning of which they are virtually frozen. This results in the level of tasks ( A, B ) already have a deterministic behavior: according to this approach, all applications or components 4 ) within a time slice of the task ( A, B ) matching input data.

Here, the outputs of all applications or components ( 4 ) within a time slice of the respective task ( A, B ) for software components dealing with the other task ( 4 ) made visible only at the beginning of the next time slot. Between the components ( 4 ) of the different tasks ( A, B ) there is thus no direct exchange within a time slice (6). Among the software components dealing with the same task ( 4 On the other hand, as shown by way of example in the case of the image lower task (B) within the second time slice, the data may be exchanged directly (5).

This method can be used, for example, in software or hardware or in a mixed form of software and hardware, for example in a control unit ( 20 ), as the schematic representation of 3 clarified.

QUOTES INCLUDE IN THE DESCRIPTION

This list of the documents listed by the applicant has been generated automatically and is included solely for the better information of the reader. The list is not part of the German patent or utility model application. The DPMA assumes no liability for any errors or omissions.

Cited patent literature

• DE 102014213245 A1 [0003]

Claims (11)

Method (10) for processing a task (A, B) by an embedded system, characterized by the following features: - until the task (A, B) has been completed, by a plurality of software components (4, 4) concerned with the task (A, B) ) Data is generated (1, 11), - the data is visualized for software components (4) dealing with other tasks (A, B) after the completion of the task (A, B) (2, 12) and - the data is included in the with the task (A, B) concerned software components (4) replaced immediately (5, 13). Method (10) according to Claim 1 , characterized by the following features: the tasks (A, B) are executed in periodic time slots of fixed duration. Method (10) according to Claim 2 , characterized by the following feature: the duration corresponds to a predetermined time grid. Method (10) according to Claim 2 or 3 characterized by the following feature: the durations of the time slots are in a predetermined relationship to one another. Method (10) according to Claim 4 characterized by the following feature: the ratio is a power of two. Method (10) according to one of Claims 1 to 5 characterized by the following feature: the system is a driver assistance system. Method (10) according to one of Claims 1 to 5 characterized by the following feature: the system is a robotic system. Method (10) according to one of Claims 1 to 7 , characterized by the following features: - the task (A, B) is a highly automated driving task. Computer program, which is arranged, the method (10) according to one of Claims 1 to 8th perform. Machine-readable storage medium on which the computer program is based Claim 9 is stored. Apparatus (20) arranged to perform the method (10) according to any one of Claims 1 to 8th perform.

Images