Method for executing a comprehensive real-time computer application by exchanging time-triggered messages among real-time software components

Patent metadata

Field	Value
Publication number	US-10019292-B2
Application number	US-201615007317-A
Country	US
Kind code	B2
Filing date	Jan 27, 2016
Priority date	Dec 2, 2015
Publication date	Jul 10, 2018
Grant date	Jul 10, 2018

Abstract

A method for executing a comprehensive real-time computer application including an application software including a description of functions on a distributed real-time computer system including sensors, actuators, computing nodes, and distributor units having access to a global time. The application software including a number of real-time software components (RTSWCs). When executed, the RTSWCs exchange information by time-triggered messages. Each RTSWC is allocated a time-triggered virtual machine TTVM, wherein, during a service interval SI, an operating system running on a computing node provides a TTVM realized on the computing node with protected access to the network resources and memory resources of the computing node assigned to the TTVM, and wherein, during the SI, a defined computing power for processing the RTSWCs running in the TTVM is allocated to the TTVM by the operating system of the computing node such that the RTSWCs provide a result before the end of the SI.

First claim

The invention claimed is:

1. A method for executing a comprehensive real-time computer application on a distributed real-time computer system, which comprises a multiplicity of sensors, actuators, computing nodes and distributor units, which have access to a global time, and wherein the comprehensive real-time computer application is contained in an application software, the method comprising:
dividing the application software into a plurality of real-time software components (RTSWCs), wherein, when the application software or the comprehensive real-time computer application is executed, the RTSWCs exchange information by time-triggered messages, and wherein each RTSWC is allocated a time-triggered virtual machine (TTVM), wherein, during a service interval (SI), an operating system running on a computing node provides the TTVM executed on the computing node with protected access to network resources and memory resources of the computing node assigned to the TTVM, wherein, during the SI, a defined computing power for processing the RTSWCs running in the TTVM is allocated to the TTVM by the operating system of the computing node such that the RTSWCs provides a result before an end of the SI, wherein in the comprehensive real-time computer application, a multiplicity of frames having different frame durations are executed, and wherein the frame durations, other than a smallest frame duration, correspond to a power of 2 of the smallest frame duration.

2. The method of claim 1 , wherein the TTVM, at a start of the SI, provides input data of the RTSWC in the form of time-triggered state data in a data region of the RTSWC and, at the end of the SI, adopts output data of the RTSWC in the form of the time-triggered state data from the data region of the RTSWC.

3. The method of claim 1 , wherein a number of the TTVMs are executed simultaneously on the computing node.

4. The method of claim 1 , wherein the operating system of the computing node compares access rights of the TTVM with access requirements of the RTSWCs running on the TTVM in order to identify security errors.

5. The method of claim 1 , wherein a communication system of the distributed real-time computer system or the operating system of the computing node deactivates a running version of the RTSWC at a switchover time scheduled a priori and activates a new version of the RTSWC on another TTVM and supplies the TTVM with communication data.

6. The method of claim 1 , wherein two identical RTSWCs run on two independent fail-silent TTVMs.

7. The method of claim 1 , wherein three identical RTSWCs run on three independent TTVMs, and wherein a receiving TTVM receives three copies of a message from the three identical RTSWCs to mask defective messages by majority voting.

8. The method of claim 1 , wherein one or more computing nodes each has two or more processors, and wherein the RTSWC is executed on two or more processors of the computing node in parallel, wherein the TTVM divides the RTSWCs among available processors of the computing node such that a computing time for the RTSWCs is reduced.

9. The method of claim 1 , wherein a time interval between a sending time and a receiving time of a message is selected to be at least long enough that a real-time message is transported from a transmitter to a receiver in a minimum time interval, wherein the time interval is longer than the minimum time interval in order to increase a flexibility of a communication system.

10. A computing node for a distributed real-time computer system, which comprises a plurality of sensors, actuators, computing nodes, and distributor units, which have access to a global time, wherein a comprehensive real-time computer application or an application software is configured to be executed on the real-time computer system, wherein the application software contains the comprehensive real-time computer application, the computing node comprising:
one or more time-triggered virtual machines (TTVMs) for executing real-time software components (RTSWCs), into which the application software is divided, are configured to be executed on the computing node, wherein, when the comprehensive real-time computer application or the application software is executed, the RTSWCs exchange information by time-triggered messages, wherein, during a service interval (SI), an operating system running on the computing node provides the TTVM executed on the computing node with protected access to network resources and memory resources of the computing node assigned to the TTVM, wherein, during the SI, a defined computing power for processing the RTSWCs running in the TTVM is allocated to the TTVM by the operating system of the computing node such that the RTSWCs provide a result before an end of the SI, wherein in the comprehensive real-time computer application, a multiplicity of frames having different frame durations are executed, and wherein the frame durations, other than a smallest frame duration, correspond to a power of 2 of the smallest frame duration.

11. A real-time computer system comprising one or more computing nodes according to claim 10 .

Assignees

• Fts Computertechnik Gmbh

Inventors

• Kopetz Hermann
• Poledna Stefan

Classifications

• G06F9/4887 Primary

  involving deadlines, e.g. rate based, periodic · CPC title

• G06F9/45558

  Hypervisor-specific management and integration aspects · CPC title

• G06F2009/4557

  Distribution of virtual machine instances; Migration and load balancing · CPC title

• G06F9/5077 Primary

  Logical partitioning of resources; Management or configuration of virtualized resources (specific details on emulation or internal functioning of virtual machines G06F9/455) · CPC title