Program Rewriting via Overlapping Divisional Programs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing program rewriting systems for control units connected to a network face challenges in efficiently rewriting programs while ensuring data integrity and controlling costs, as they often require large storage capacities and lack effective verification mechanisms for program correctness.
Innovation Solution
A program rewriting system comprising a type 1 node and multiple type 2 nodes connected via a network, where each type 2 node stores a divisional program with overlapping contents, allowing for efficient transmission and verification of program updates to the type 1 node, eliminating the need for extensive storage capacity and ensuring program correctness through overlapping content verification.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If one node stores all program rewriting data, then program rewriting can be performed, but the cost of that node becomes excessively high
Solution Approach 1:
The program rewriting data is divided into multiple divisional programs and distributed across different type 2 nodes. Each type 2 node stores only a portion of the rewriting data rather than the complete program, thereby reducing individual node costs while maintaining overall rewriting capability through collaborative transmission to the type 1 node.
2Device complexity
If program rewriting data is distributed across multiple nodes, then node costs are reduced, but verification of program correctness becomes difficult
Solution Approach 1:
Overlapping portions are intentionally included in the divisional programs stored at type 2 nodes before transmission. This preliminary inclusion of redundant data enables the type 1 node to perform verification by comparing the overlapping sections, ensuring program correctness without requiring complex external verification mechanisms.
3Reliability
If divisional programs with overlapping contents are used, then program verification is enabled, but transmission data volume increases
Solution Approach 1:
Instead of transmitting complete redundant copies of the entire program, only partial overlapping portions are included in the divisional programs. This partial redundancy provides sufficient verification capability while minimizing the increase in transmission data volume, achieving an optimal balance between verification and efficiency.
Data Source
AI summary
Each of a plurality of type 2 nodes stores one of divisional programs, which are created as parts of a rewriting program for rewriting a program for determining the operation of a type 1 node, by dividing the rewriting program in a manner that allows a partial overlap in data between a divisional program stored in the type 2 node and a divisional program stored in another type 2 node. When divisional programs to the type 1 node are transmittable, each type 2 node transmits the divisional program stored in its own node to the type 1 node via a first network. The type 1 node rewrites a part that corresponds to the received divisional program, and uses the overlapping data to verify whether or not the divisional programs rewritten are the same.