公开(公告)号：US20130060526A1

公开(公告)日：2013-03-07

申请号：US13638438

申请日：2011-03-16

Applicant: Dietmar Geiger ,  Michael Paulitsch

Inventor： Dietmar Geiger ,  Michael Paulitsch

IPC: G06F11/30

CPC classification number: G06F11/1641 ,  G06F11/184 ,  G06F11/188

Abstract: A computer system includes at least two COTS processor cores and an evaluating device connected to the at least two COTS processor cores for evaluating output signals output by means of the at least two COTS processor cores. The evaluating device includes a comparator for pair-wise comparison of the respective generated output signals with each other. The comparator also outputs a comparison signal corresponding to the respective comparison of the output signals.

Abstract translation: 计算机系统包括至少两个COTS处理器核心和连接到至少两个COTS处理器核心的评估装置，用于评估通过至少两个COTS处理器核心输出的输出信号。 评估装置包括用于将各个产生的输出信号彼此成对比较的比较器。 比较器还输出与输出信号的相应比较对应的比较信号。

公开(公告)号：US20100281130A1

公开(公告)日：2010-11-04

申请号：US12595414

申请日：2008-04-08

Applicant: Hermann Kopetz ,  Wilfried Steiner ,  Gunther Bauer ,  Matthias Wachter ,  Brendan Hall ,  Michael Paulitsch

Inventor： Hermann Kopetz ,  Wilfried Steiner ,  Gunther Bauer ,  Matthias Wachter ,  Brendan Hall ,  Michael Paulitsch

IPC: G06F15/16 ,  H04L9/32

CPC classification number: H04L12/44 ,  H04J3/0655 ,  H04L12/40026 ,  H04L12/417

Abstract: The goal of the present invention is to improve the useful data efficiency and reliability in the use of commercially available ETHERNET controllers, in a distributed real time computer system, by a number of node computers communicating via one or more communication channels by means of TT ETHERNET messages. To achieve this goal, a distinction is made between the node computer send time (KNSZPKT) and the network send time (NWSZPKT) of a message. The KNSZPKT must wait for the NWSZPKT, so that under all circumstances, the start of the message has arrived in the TT star coupler at the NWSZPKT, interpreted by the clock in the TT star coupler. The TT star coupler is modified, so that a message arriving from a node computer is delayed in an intelligent port of the TT star coupler until the NWSZPKT can send it precisely at the NWSZPKT into the TT network.

Abstract translation: 本发明的目的是在分布式实时计算机系统中，通过多个通过一个或多个通信信道通过TT ETHERNET进行通信的节点计算机，在商业上可获得的以太网控制器的使用中提高有用的数据效率和可靠性 消息。 为了实现这一目标，区分消息的节点计算机发送时间（KNSZPKT）和网络发送时间（NWSZPKT）。 KNSZPKT必须等待NWSZPKT，所以在任何情况下，消息的开始已经到达NWSZPKT的TT星形耦合器，由TT星形耦合器的时钟解释。 TT星形耦合器被修改，使得从节点计算机到达的消息在TT星形耦合器的智能端口中被延迟，直到NWSZPKT可以在NWSZPKT将其精确地发送到TT网络中。

公开(公告)号：US07656881B2

公开(公告)日：2010-02-02

申请号：US11610450

申请日：2006-12-13

Applicant: Brendan Hall ,  Michael Paulitsch ,  Kevin R. Driscoll

Inventor： Brendan Hall ,  Michael Paulitsch ,  Kevin R. Driscoll

IPC: H04L12/28

CPC classification number: H04L12/437 ,  H04J3/0641 ,  H04J3/0652 ,  H04J3/0676 ,  H04L12/4015 ,  H04L12/43 ,  H04L2012/40273

Abstract: In one embodiment, a system comprises a plurality of nodes that are communicatively coupled to one another. Each of the plurality of nodes, in the absence of any faults, is communicatively coupled to at least a first neighbor node and a first neighbor's neighbor node and a second neighbor node and a second neighbor's neighbor node. When at least a first clique and a second clique exist within the plurality of nodes and a first node included in the first clique successfully receives a synchronization message associated with the second clique from the first neighbor node of the first node and the first neighbor's neighbor node of the first node, the first node does the following. The first node defects to the second clique and synchronizes to the synchronization message. The first node also communicates a join message to at least the second neighbor node of the first node and the second neighbor's neighbor node of the first node. The join message indicates that the second neighbor node and the second neighbor's neighbor node should defect to the second clique and listen for a subsequent synchronization message from the second clique to which the second neighbor node and the second neighbor's neighbor node should synchronize.

Abstract translation: 在一个实施例中，系统包括通信地彼此耦合的多个节点。 在没有任何故障的情况下，多个节点中的每一个通信地耦合到至少第一邻居节点和第一邻居的邻居节点以及第二邻居节点和第二邻居的邻居节点。 当在所述多个节点内存在至少第一组和第二组时，并且包括在所述第一组中的第一节点成功地从所述第一节点的第一相邻节点和所述第一邻居的邻居节点接收到与所述第二组相关联的同步消息 的第一个节点，第一个节点执行以下操作。 第一个节点缺陷到第二个组，同步到同步消息。 第一节点还将连接消息传送到第一节点的第二邻居节点和第一节点的第二邻居节点。 加入消息指示第二邻居节点和第二邻居的邻居节点应该缺陷到第二集团，并且从第二邻居节点和第二邻居邻居节点应该同步的第二组收听后续同步消息。

公开(公告)号：US07606179B2

公开(公告)日：2009-10-20

申请号：US10993933

申请日：2004-11-19

Applicant: Brendan Hall ,  Kevin Driscoll ,  Michael Paulitsch

Inventor： Brendan Hall ,  Kevin Driscoll ,  Michael Paulitsch

IPC: H04L12/28

CPC classification number: H04L12/43 ,  H04L12/437

Abstract: In one embodiment, a node comprises an interface to communicatively couple the node to a channel. The channel communicatively couples the node to a first neighbor node and a first neighbor's neighbor node in a first direction. When the node relays relayed data along the channel, the node compares data received from the first neighbor node with data received from the first neighbor's neighbor node. The relayed data comprises: at least one of: the data received from the first neighbor node and the data received from the first neighbor's neighbor node; and information indicative of the results of the comparison.

Abstract translation: 在一个实施例中，节点包括将节点通信地耦合到信道的接口。 该信道在第一方向上将节点通信地耦合到第一邻居节点和第一邻居的邻居节点。 当节点沿着信道中继中继数据时，节点将从第一邻居节点接收的数据与从第一邻居邻居节点接收的数据进行比较。 所述中继数据包括：从所述第一邻居节点接收的数据和从所述第一邻居的邻居节点接收的数据中的至少一个; 以及表示比较结果的信息。

公开(公告)号：US20090141744A1

公开(公告)日：2009-06-04

申请号：US12198611

申请日：2008-08-26

Applicant: Stefan Poledna ,  Martin Schwarz ,  Guenther Bauer ,  Wilfred Steiner ,  Brendan Hall ,  Michael Paulitsch

Inventor： Stefan Poledna ,  Martin Schwarz ,  Guenther Bauer ,  Wilfred Steiner ,  Brendan Hall ,  Michael Paulitsch

IPC: H04J3/06 ,  H04J3/00

CPC classification number: H04L12/40026 ,  H04J3/0602 ,  H04J3/0694 ,  H04L12/40032 ,  H04L69/28 ,  H04L2012/40241

Abstract: A special node is used in a distributed time-triggered cluster. The special node comprises protocol functionality to establish a time base to use in communicating with a plurality of end nodes and to source timing-related frames to the plurality of end nodes in accordance with the distributed time-triggered communication protocol. The protocol functionality establishes the time base without regard to any timing-related frame sourced from any of the plurality of end nodes. In one embodiment, the protocol functionality of the special node is implemented in a low complexity manner. In one embodiment, the cluster comprises a star topology and the special node performs at least one of semantic filtering and rate enforcement. In another embodiment, the cluster comprises a bus or peer-to-peer topology and each end node is coupled to the communication channel using a low-complexity special local bus guardian.

Abstract translation: 在分布式时间触发的群集中使用特殊节点。 特殊节点包括协议功能，以建立用于与多个终端节点进行通信的时基，并根据分布式时间触发通信协议向多个终端节点发送与时序相关的帧。 协议功能建立时基，而不考虑来自多个终端节点中的任一个的任何与时序有关的帧。 在一个实施例中，以低复杂度方式实现特殊节点的协议功能。 在一个实施例中，集群包括星形拓扑，并且特殊节点执行语义过滤和速率实施中的至少一个。 在另一个实施例中，群集包括总线或对等拓扑，并且每个端节点使用低复杂度的特殊本地总线监控器耦合到通信信道。

公开(公告)号：US20050152379A1

公开(公告)日：2005-07-14

申请号：US11010249

申请日：2004-12-10

Applicant: Brendan Hall ,  Kevin Driscoll ,  Michael Paulitsch

Inventor： Brendan Hall ,  Kevin Driscoll ,  Michael Paulitsch

IPC: H04L12/28

CPC classification number: H04L12/437 ,  G06F11/2007

Abstract: In one embodiment, one or more self checking pairs are implemented at the application layer in a network that supports the qualified propagation of data at the transport layer (for example, in a network having a braided ring topology).

Abstract translation: 在一个实施例中，在支持传输层（例如，具有编织环拓扑的网络中）数据的合格传播的网络中的应用层处实现一个或多个自检对。

公开(公告)号：US20210112388A1

公开(公告)日：2021-04-15

申请号：US17131712

申请日：2020-12-22

Applicant: Rafael Rosales ,  Florian Geissler ,  Michael Paulitsch ,  Ralf Graefe ,  Neslihan Kose Cihangir

Inventor： Rafael Rosales ,  Florian Geissler ,  Michael Paulitsch ,  Ralf Graefe ,  Neslihan Kose Cihangir

IPC: H04W4/40 ,  H04W24/08 ,  G08G1/0968 ,  G01C21/34

Abstract: Disclosed embodiments prioritize gaps in V2X coverage and then selectively route traffic based on the prioritized gaps. Some embodiments combine historical vehicle presence along a route with predicted prospective vehicle traffic along the route to generate a map of regions that have a high confidence of a need for V2X coverage. This high confidence map is compared to a historical V2X coverage in those regions. From this comparison, a set of high priority V2X gaps is identified. Vehicles are then selectively routed either around or into the gaps.

公开(公告)号：US20210110706A1

公开(公告)日：2021-04-15

申请号：US17131900

申请日：2020-12-23

Applicant: Ralf Graefe ,  Michael Paulitsch ,  Norbert Stoeffler

Inventor： Ralf Graefe ,  Michael Paulitsch ,  Norbert Stoeffler

IPC: G08G1/005 ,  H04W4/02 ,  H04W4/029 ,  G01C21/16

Abstract: Various systems and methods for pedestrian traffic management are described herein, comprising segmenting a pedestrian route into at least one pedestrian walking segment using location information of transportation resources, and determining estimated transit times for the at least one pedestrian walking segment and an estimated wait time for the first transportation resource using received status information of the first transportation resource and the determined estimated transit time for the first pedestrian walking segment.

公开(公告)号：US20150006760A1

公开(公告)日：2015-01-01

申请号：US14485835

申请日：2014-09-15

Applicant: Wilfried Steiner ,  Gunther Bauer ,  Matthias Wachter ,  Brendan Hall ,  Michael Paulitsch

Inventor： Wilfried Steiner ,  Gunther Bauer ,  Matthias Wachter ,  Brendan Hall ,  Michael Paulitsch

IPC: H04L29/08

CPC classification number: H04L67/1095 ,  H04J3/0641 ,  H04J3/0664 ,  H04J3/067 ,  H04J3/0673 ,  H04J3/0679

Abstract: The invention relates to a method for synchronizing local clocks in a distributed computer network, where said computer network consists of a number of components that are connected to each other via bi-directional communication links, characterized in thata) an a priori configured set of components of the network generates synchronization messages and sends these synchronization messages to the network, andb) an a priori configured set of components consumes the generated synchronization messages, andc) one or more message-relaying components in between a component that generates a synchronization message and the component that consumes the synchronization message will add a delay value to the synchronization message reflecting the delay imposed by the message-relaying component,d) a component that is configured to consume a synchronization message will delay a received synchronization message upon reception for a duration that is calculated by an a priory configured value for the maximum transmission delay (“Maximum Transmission Delay”) minus the value of the sum of all delay values added to the received message before further usage of the message in the synchronization process of said component.

Abstract translation: 本发明涉及一种用于在分布式计算机网络中同步本地时钟的方法，其中所述计算机网络由通过双向通信链路相互连接的多个组件组成，其特征在于：a）先验配置的一组 网络的组件生成同步消息并将这些同步消息发送到网络，以及b）先验配置的组件集消耗所生成的同步消息，以及c）生成同步的组件之间的一个或多个消息中继组件 消息和消耗同步消息的组件将向反馈由消息中继组件施加的延迟的同步消息添加延迟值，d）被配置为消耗同步消息的组件将在接收时延迟所接收的同步消息 一个持续时间是由一个小型配置值计算的 最大传输延迟（“最大传输延迟”）减去在所述组件的同步过程中进一步使用消息之前添加到接收到的消息的所有延迟值之和的值。

公开(公告)号：US08339993B2

公开(公告)日：2012-12-25

申请号：US12437178

申请日：2009-05-07

Applicant: Michael Paulitsch ,  Brendan Hall ,  Kevin R. Driscoll

Inventor： Michael Paulitsch ,  Brendan Hall ,  Kevin R. Driscoll

IPC: H04L12/28

CPC classification number: H04L12/42 ,  H04L12/413 ,  H04L12/437

Abstract: A method of configuring a node comprises receiving a first message having a count field value from a first direct link; receiving a second message having a count field value from a first skip link; adjusting the count field value in the first message by a first adjustment amount; adjusting the count field value in the second message by a second adjustment amount; comparing the adjusted count field value in the first message with the adjusted count field value in the second message; if the adjusted count field value in the first message matches the adjusted count field value in the second message, using the adjusted count field value in the first message to determine a node identity for the node; and processing subsequent messages based on the node identity.

Abstract translation: 一种配置节点的方法包括从第一直接链路接收具有计数字段值的第一消息; 从第一跳过链接接收具有计数字段值的第二消息; 将第一消息中的计数字段值调整为第一调整量; 将第二消息中的计数字段值调整第二调整量; 将第一消息中的调整后的计数字段值与第二消息中调整后的计数字段值进行比较; 如果第一消息中的经调整的计数字段值与第二消息中调整的计数字段值匹配，则使用第一消息中调整的计数字段值来确定节点的节点标识; 以及基于节点身份处理后续消息。