Memory Event Log Buffering With Indexed File Chunks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing memory devices face inefficiencies in storing event log data due to algorithms that either prioritize optimal data density at the cost of high run-time overhead or minimize overhead at the expense of low storage efficiency, leading to resource occupation and increased storage costs.
Innovation Solution
A method that utilizes an event log file with individually referenceable subsections or file chunks, employing a buffer to consolidate event log data at the time of writing, and using indices to track the end of the data, thereby avoiding the need to read data out before each write and reduce data padding.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If algorithms prioritize optimal data density for event log storage, then storage efficiency is improved, but run-time overhead increases
Solution Approach 1:
The event log file is divided into multiple subsections or file chunks that can be individually referenced. This segmentation allows the system to work with smaller, manageable units of data, improving both storage efficiency and access performance by avoiding the need to read entire files.
Solution Approach 2:
Indices are pre-calculated and maintained to track the end of data in each file chunk. This preliminary action eliminates the need to read through data during write operations, as the system already knows where data ends, thereby reducing run-time overhead while maintaining optimal data density.
2Productivity
If algorithms minimize run-time overhead by avoiding data reading, then operational speed is improved, but storage efficiency decreases
Solution Approach 1:
A buffer is introduced as an intermediary component that consolidates event log data before writing to the event log file. This buffer allows the system to minimize run-time overhead by avoiding repeated reads, while the consolidation process ensures optimal data density is achieved during the write operation.
Solution Approach 2:
Data is copied and consolidated in a buffer before being written to the final event log file. This copying mechanism allows the system to prepare data efficiently in memory, reducing run-time overhead, while ensuring that the final written data achieves optimal density in the storage medium.
3Ease of operation
If data padding is used to simplify write operations, then ease of operation is improved, but storage space is wasted
Solution Approach 1:
The system changes the parameter of data organization by using indices to precisely track data boundaries instead of relying on fixed-size padding. This allows write operations to be simple and direct, writing only the necessary amount of data to exact locations, thereby eliminating storage space waste while maintaining ease of operation.
Data Source
AI summary
Memory with efficient storage of event log data is disclosed herein. In one embodiment, a memory device includes a non-volatile memory subsystem storing a persistent event log file, and a volatile memory subsystem including a working buffer. The memory device is configured to write newly generated event log data of the memory device to the working buffer. The memory device is further configured to write the newly generated first event log data to a first subregion of the persistent event log file. The first subregion can be one of a plurality of subregions of the persistent event log file, and can correspond to an end of event log data stored to the persistent event log file. The volatile memory subsystem can be positioned inside or outside a controller operably connected to the non-volatile memory subsystem.