Communication Schedule Grid for Distributed Real-Time Nodes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In distributed real-time computer systems, particularly in automobiles, the need for different communication schedules for various cluster variants leads to logistical and cost issues due to the requirement of multiple node variants and time-consuming schedule loading processes, which can result in errors and inefficiencies.
Innovation Solution
A method is developed to create communication schedules using a 'grid' of parameters that enables the use of invariant components across multiple cluster variants by deriving nodal communication schedules and then cluster communication schedules, ensuring compatible interactions without the need for extensive testing or manual parameter manipulation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multiple node variants are provided for different cluster variants, then communication schedules can be optimized for each variant, but device complexity and production costs increase
Solution Approach 1:
The patent applies universality by creating a single node variant that can function in multiple cluster variants through configurable communication schedules. The node is designed with a universal interface that can be adapted to different cluster configurations without requiring hardware changes, thus reducing device complexity while maintaining optimized communication performance across different applications.
Solution Approach 2:
The patent utilizes parameter changes by modifying communication schedule parameters (such as timing, messaging protocols, and data formats) rather than changing the physical node hardware. This allows the same node variant to be adapted to different cluster variants through software configuration, eliminating the need for multiple hardware variants and reducing production complexity.
2Manufacturing precision
If communication schedules are loaded on the production bench, then correct configuration can be ensured, but time is consumed and logistic problems arise
Solution Approach 1:
The patent applies preliminary action by pre-configuring communication schedules in a standardized format that can be automatically loaded or self-configured in the target system. The schedule parameters are prepared in advance in a universal format, eliminating the need for manual loading on the production bench and reducing both time consumption and configuration errors.
Solution Approach 2:
The patent utilizes copying by creating reusable communication schedule templates that can be copied and adapted to different cluster variants. Instead of manually loading schedules for each variant, the same template can be copied and configured through parameter changes, significantly reducing production time and logistical complexity while maintaining configuration accuracy.
3Adaptability or versatility
If cluster variants are created with different communication schedules, then specific application requirements can be met, but costs and complexity increase
Solution Approach 1:
The patent applies universality by designing a single node variant with a universal communication interface that can serve multiple cluster variants. The node is configured with a universal schedule parser and message handler that can adapt to different communication requirements through software configuration, eliminating the need for multiple specialized node variants and reducing overall system complexity.
Solution Approach 2:
The patent utilizes dynamics by implementing configurable communication schedules that can be dynamically adjusted for different cluster variants without changing the node hardware. The communication parameters (timing, messaging protocols, data formats) are made dynamic and can be reconfigured through software, allowing the same physical node to adapt to different application-specific requirements while maintaining a simple, unified hardware design.
Data Source
AI summary
A method for establishing communication schedules for a distributed real-time computer system comprising nodal computers, wherein: a) a grid (RAS) is created, which contains all of the parameters necessary to enable basic communication between nodes (KR1 . . . KR5) of a cluster (CLU); b) nodal communication schedules (KPG; KP1, KP2) for all nodes planned to be used as invariant components (KR2; KR2, KR3) are derived from the grid (RAS) and all parameters of the grid are copied and node-specific parameters are added; and c) cluster communication schedules (CP1, CP2; CL1, CL2) are derived from the nodal communication schedules (KPG; KP1, KP2), which contain, in addition to all parameters of the grid and the node-specific parameters of the invariant components, those parameters which are relevant to the remaining nodes of the cluster.


