In-Place Structure for Graphical Program Memory Sharing

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current graphical programming environments face inefficiencies in memory utilization, as they lack the ability to specify which data containers should share memory, leading to performance issues and potential memory exhaustion, especially in real-time applications.

Innovation Solution

The introduction of an 'in-place structure' within graphical programs allows users to indicate that data memory of one element can be used for another, optimizing memory use by minimizing duplication and copying through the use of boundary nodes and configuration options.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If graphical programming environments allocate separate memory for each data container, then data access and program execution are simplified, but memory utilization becomes inefficient and memory exhaustion may occur

Engineering Contradiction:
Improveprogram execution reliabilityVSAvoidmemory usage
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The patent applies merging by allowing multiple data containers to share the same memory allocation. The system enables different data containers to be mapped to identical memory addresses, thereby consolidating memory resources and improving utilization efficiency while maintaining program reliability through controlled sharing mechanisms

Inventive Principle:
Principle #5Merging (Combining)

2Quantity of substance

If the system allows flexible memory sharing between data containers, then memory utilization is optimized, but determining which containers should share memory becomes complex

Engineering Contradiction:
Improvememory utilization efficiencyVSAvoidmemory allocation complexity
Core Design Contradiction:
Quantity of substanceVSDevice complexity

Solution Approach 1:

The patent implements self-service through automatic memory sharing determination. The system includes mechanisms that automatically analyze data container relationships and determine optimal memory sharing configurations without requiring manual intervention, thereby optimizing memory utilization while keeping the system manageable

Inventive Principle:
Principle #25Self-service

3Stability of the object's composition

If memory is allocated for every data container in graphical programs, then data integrity is maintained, but the system size grows excessively large

Engineering Contradiction:
Improvedata integrityVSAvoidsystem size
Core Design Contradiction:
Stability of the object's compositionVSVolume of stationary object

Solution Approach 1:

The patent applies merging by consolidating memory resources across multiple data containers. By allowing different containers to reference the same memory space, the system reduces overall memory consumption and prevents excessive system growth while maintaining data integrity through controlled access mechanisms

Inventive Principle:
Principle #5Merging (Combining)

Data Source

PatentUS8392878B2In-place structure in a graphical program
Publication Date: 2013.03.05 NATIONAL INSTRUMENTS CORP
  • US8392878B2 patent drawing
  • US8392878B2 patent drawing
  • US8392878B2 patent drawing

AI summary

System and method for including an in-place structure in a graphical program. Input including the structure in the graphical program may be received, where the structure is displayed in the graphical program. At least one graphical program node may be associated with the structure. The at least one graphical program node may be executable to manipulate at least one of a first element or a second element. The structure may specify that data memory of the first element is useable as the data memory of the second element in the graphical program. The structure may be usable by a development environment to reduce memory usage of the graphical program during execution.