Intermediate Data Preservation in Render Graphs

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

The existing rendering process for computer-generated animation is delayed due to the time and resource-intensive generation of intermediate data, which downstream nodes must wait for, leading to substantial delays in rendering computer-generated scenes.

Innovation Solution

Implementing a file management module that preserves and reuses intermediate data generated by processing nodes in a render setup graph, allowing downstream nodes to access pre-generated data instead of waiting for real-time generation, and optimizing storage for speed and efficiency, enabling abstraction and sharing of data across different render setup graphs.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of time

If intermediate data is generated in real-time by upstream nodes and sent directly to downstream nodes, then data freshness is maintained, but rendering process is substantially delayed while awaiting intermediate data generation

Engineering Contradiction:
Improverendering delayVSAvoidintermediate data generation speed
Core Design Contradiction:
Loss of timeVSProductivity

Solution Approach 1:

The system performs preliminary action by generating and preserving intermediate data in advance before it is actually needed by downstream nodes. The file management module stores intermediate data generated by upstream nodes in a persistent format, allowing downstream nodes to retrieve pre-generated data instead of waiting for real-time generation, thereby eliminating rendering delays while maintaining data availability.

Inventive Principle:
Principle #10Preliminary action

2Adaptability or versatility

If intermediate data is preserved in remote storage for reuse, then data accessibility is improved across different render setup graphs, but data transmission speed may be reduced compared to local storage

Engineering Contradiction:
Improvedata reuse across graphsVSAvoiddata transmission speed
Core Design Contradiction:
Adaptability or versatilityVSSpeed

Solution Approach 1:

The system creates local copies of intermediate data files that can be disposed of or regenerated from source data. Instead of maintaining expensive persistent remote storage connections for every data access, the system allows downstream nodes to create temporary local copies of intermediate data, use them quickly, and then discard them, achieving both fast local access and flexible data reuse across different render setup graphs.

Inventive Principle:
Principle #27Cheap short-living objects (Disposable)

Data Source

PatentEP2779104B1Preserving and reusing intermediate data
Publication Date: 2019.05.08 DREAMWORKS ANIMATION LLC
  • EP2779104B1 patent drawingFigure 1~2
  • EP2779104B1 patent drawingFigure 3~4
  • EP2779104B1 patent drawingFigure 5

AI summary

Preservation and reuse of intermediate data generated in a render setup graph for computer animation is disclosed. A processing node in the graph can generate intermediate data and, rather than send it directly to a downstream node in the graph, preserve it for reuse during subsequent processing. As a result, a downstream processing node can reuse the preserved intermediate data, rather than wait while the intermediate data is generated by the processing node in realtime. An intermediate data file management module can manage this process by storing the generated intermediate data in a file for preservation, retrieving the stored intermediate data from the file for reuse, optimizing the file storage location for speed and efficiency, and facilitating sharing of the intermediate data during collaboration between users.