Storage Class Memory Page Status Tracking via Circular Pointer Array
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Storage class memory devices face inefficiencies in tracking page status, particularly in locating invalid or free pages for writing or maintenance operations, due to significant overhead in data and processing requirements, especially in embedded systems with limited computational resources.
Innovation Solution
A data structure organized as a circular array with three pointers is introduced to efficiently manage page status, allowing for single-direction pointer movement to locate free or invalid pages, reducing the need for bit maps and minimizing search iterations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional bit map methods are used to track page status in storage class memory, then complete page status information can be maintained, but significant data and processing overhead is generated
Solution Approach 1:
The patent extracts only the essential status information needed for operation (valid/invalid distinction) rather than maintaining complete page status bit maps. This extraction approach reduces data overhead while preserving the reliability needed for write and maintenance operations by focusing only on the critical status bits required for functional correctness.
Solution Approach 2:
Instead of tracking all possible page statuses with comprehensive bit maps, the patent inverts the approach by using a simplified status representation that tracks only the essential valid/invalid state. This inversion reduces complexity while maintaining sufficient reliability for the intended operations by considering what minimum information is actually needed rather than what complete information exists.
2Loss of information
If comprehensive page status tracking is implemented, then all page states can be monitored, but processing overhead increases significantly in resource-constrained environments
Solution Approach 1:
The patent extracts only the essential status information (valid/invalid page state) required for storage class memory operations, eliminating the need to process and maintain comprehensive page status bit maps. This extraction reduces computational overhead and energy consumption while preserving the critical information needed for write and maintenance operations.
Solution Approach 2:
The patent changes the parameter representation from comprehensive status bit maps to a simplified valid/invalid indicator system. This parameter change reduces the amount of data that must be processed and stored, thereby reducing computational overhead and energy consumption in resource-constrained embedded systems while maintaining sufficient information for operational reliability.
3Quantity of substance
If traditional page status management is used, then all pages can be tracked, but search iterations increase for locating free or invalid pages
Solution Approach 1:
The patent applies preliminary action by pre-organizing page status information in a structured format that enables efficient location of free or invalid pages. Instead of requiring linear search through comprehensive status bit maps, the system pre-processes and structures the status data so that pages can be located with minimal search iterations, reducing time loss while maintaining tracking of all pages.
Data Source
AI summary
Devices and techniques for storage class memory status are disclosed herein. A storage portion characteristics data structure is maintained. Here, the data structure includes an array of elements—where each element is sized to contain a reference to a storage portion in a storage class memory storage device, a first pointer to a first element in the array of elements, a second pointer to a second element in the array of elements, and a third pointer to a third element in the array of elements. The data structure includes a direction of pointer motion in which the second pointer precedes the third pointer and the first pointer precedes the second pointer with respect to the direction of pointer motion. A write request is performed to a storage portion reference retrieved from the first element. The first pointer is then advanced.