Variable Data Caching for High-Speed Printing Systems
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In variable printing systems, the high CPU resource consumption due to frequent cache searches and data rendering processes leads to delays and inefficiencies, especially when handling sensitive data that requires confidentiality and high-speed printing.
Innovation Solution
An information processing system that includes a generation unit for generating variable data and a rendering unit, with a management unit to store and associate variable data with identification information, allowing for cache-based data reuse and minimizing CPU resource consumption by avoiding delays in the rendering process through efficient data management and caching algorithms.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If cache search is performed to reuse rendered data, then rendering process speed is improved, but CPU resources are consumed for search operations
Solution Approach 1:
The management node pre-loads key data from the managed node before the actual rendering process begins. This preliminary action ensures that when rendering is needed, the key data is already available in memory, eliminating the need for time-consuming cache searches during the rendering process itself.
Solution Approach 2:
The patent extracts the key data loading operation from the rendering process timeline. By separating the key data acquisition step and performing it in advance, the system removes the bottleneck of cache searching from the critical rendering path, allowing rendering to proceed without waiting for data retrieval.
2Stability of the object's composition
If all key data is passed along every time a change occurs, then data consistency is maintained, but CPU resources are consumed for search and matching operations
Solution Approach 1:
The patent extracts only the changed key data from the managed node and transfers only that specific data to the management node, rather than transferring all key data. This selective data transfer reduces the volume of data that needs to be processed and matched, significantly lowering CPU resource consumption while maintaining data consistency.
Solution Approach 2:
The system applies local quality by treating changed data differently from unchanged data. Only the specific key data that has changed is identified, extracted, and transferred, rather than treating all data uniformly. This localized approach to data management optimizes resource usage by focusing processing efforts only on the necessary data portions.
3Productivity
If variable printing is performed with high-speed requirements, then productivity is improved, but the time for reading identification information to printing is very short leaving no room for cache search
Solution Approach 1:
The management node performs the key data loading action in advance, before the high-speed printing process begins. This preliminary data preparation eliminates the need for cache searches during the time-critical printing operation, ensuring that all necessary key data is already available in memory when printing starts.
Solution Approach 2:
The patent ensures continuous useful action by maintaining key data in memory at the management node throughout the printing process. Rather than intermittently searching for data, the system maintains continuous availability of all key data, allowing the printing process to proceed without interruption or waiting time.
Data Source
AI summary
An information processing system of the present invention includes a data generation device that generates variable data, and a rendering device that performs rendering of the variable data. A first data storing unit of the data generation device stores, as a first correspondence relationship, the generated variable data and identification information for identifying the variable data in association with each other, and a first data management unit manages the first correspondence relationship based on a predetermined management scheme. A cache search unit searches for predetermined variable data from the first correspondence relationship, and a cache hit determination unit determines that rendering data obtained by performing rendering on the variable data is cached when there is predetermined variable data in the first correspondence relationship.