Granted Patent B2

US 12,443,451 · App. 18/901,209 · Granted Oct 14, 2025

Inventors: Sonja Steffens (Evessen, DE); Michael Hofer (Uitikon, CH); Matthias Bolz (Braunschweig, DE); Stefan Gerken (Braunschweig, DE)

Assignee: Siemens Mobility GmbH

G06F9/5027

Abstract

Claims (35)

1. A method for a computer-aided execution of a technical process, which comprises the steps of:

a) executing application programs redundantly in a redundancy group containing a plurality N of computing entities and thereby calculate a plurality N of redundant results;

b) carrying out a comparison of a plurality N of messages containing the redundant results in a voting;

c) using a majority of messages for further execution of the technical process in an event that the majority of the messages contain identical results;

d) forming processing units from a plurality N of the redundancy groups each having the plurality N of computing entities, a plurality of different said computing entities is combined in each of the processing units, wherein none of the processing units contains a plurality of said computing entities from one and a same said redundancy group;

e) comparing a respectively generated plurality N of redundant messages in the voting if the redundant messages are to be sent as external messages to the computing entities, which do not belong to the processing units, in which the redundant messages were generated;

f) carrying out no voting for the redundant messages that are exchanged as internal messages between the computing entities within a processing unit;

g.1) operating a plurality of N the processing units in work cycles;

g.2) transferring, at a beginning of each work cycle, messages required for the work cycle and addressed to the computing entities of the processing unit concerned to the processing unit;

h) subsequently processing all the messages required for an execution of the application programs by the computing entities in the plurality N of processing units in identical order, wherein new redundant messages are generated; and

i) comparing the new redundant messages with each other in the steps b), c), d) and e).

2. The method for the computer-aided execution according to claim 1 , wherein the step h) is carried out in sub-cycles, wherein:

j) the computing entities of each of the plurality N of processing units receive the messages addressed to them;

k) the messages are then processed, with new internal messages generated during processing being stored in at least one intermediate buffer of a processing unit of the processing units;

l) Subsequently, the messages stored in the at least one intermediate buffer in step k) are sorted taking into account sorting rules which are identical for all of the plurality N of processing units concerned; and

m) steps j) and k) and l) are repeated, with the computing entities receiving and processing the messages addressed to them that were newly created in previous step k), until there are no more unprocessed internal messages addressed to the computing entities in the at least one intermediate buffer.

3. The method for computer-aided execution according to claim 1 , which further comprises performing the voting in a computing entity which does not belong to any of the plurality N of redundancy groups.

4. The method for computer-aided execution according to claim 1 , wherein the application programs consist of utility programs aimed at the computer-aided execution of the technical process and service programs supporting functions of a computing environment.

5. The method for computer-aided execution according to claim 1 , wherein all the processing units containing the computing entities of a redundancy group are each implemented on a different processor or at least each on a different computing core.

6. A computing environment, comprising:

a plurality of computing entities, wherein a plurality N of the computing entities are combined to form one of a plurality of redundancy groups and all said computing entities in each redundancy group of said redundancy groups are set up to execute an application program redundantly;

the computing environment being further divided into a plurality N of processing units derived from said redundancy groups, wherein:

a) a plurality of said computing entities are combined to form each of said processing units;

b) none of said processing units contains a plurality of said computing entities from one and a same said redundancy group;

a plurality of computing cores of a processor are combined in at least one of said processing units;

the computing environment having a computing entity from said computing entities that is set up:

c) to compare in a voter in a voting a plurality N of redundant messages generated by said computing entities, in an event that the redundant messages leave one of said processing units as external messages;

d) not to compare the redundant messages in an event that the redundant messages are exchanged as internal messages between said computing entities within said processing unit;

said plurality of N processing units operates in work cycles, wherein:

e) at a beginning of each work cycle, messages required for the work cycle and addressed to said computing entities of said processing unit concerned are transferred to said processing unit;

f) subsequently, all the messages required for an execution of the application programs are processed by said computing entities in said plurality N of processing units in identical order, wherein new redundant messages are generated;

g) the new redundant messages are then compared with each other in the step c).

7. The computing environment according to claim 6 , wherein said computing entity set up as said voter is an external computing entity that does not belong to said redundancy group from which it is set up to receive redundancy messages for voting.

8. The computing environment according to claim 6 , wherein said voter is one of a plurality of voters.

9. A non-transitory computer readable medium having computer-executable instructions which when executed on a computer perform the method according to claim 1 .

Assignments (3)

Priority Claims (1)

Continuity (1)

References Cited (35)