Storage Management System Using Cursor Pointers for Memory Allocation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
High-availability storage systems face complexity in efficiently managing memory portions due to the large quantity of memory available, making simple processes like assigning memory for tasks complex.
Innovation Solution
The implementation of a computer-implemented method using cursor pointers to maintain and update search locations within defined search windows to efficiently locate and manage unused or moderately utilized memory blocks within a storage platform, allowing for effective storage space management.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If simple memory assignment processes are used, then the process is easy to implement, but the system becomes complex due to the large quantity of memory available
Solution Approach 1:
The patent introduces cursor pointers as intermediary data structures that mediate between the storage management system and the large quantity of memory blocks. These cursor pointers serve as lightweight mediators that track and manage memory block states without requiring complex direct management of all memory resources, thus resolving the contradiction between simple implementation and system complexity.
2Measurement precision
If the search window is expanded to find unused memory blocks, then the search coverage is improved, but the search time increases
Solution Approach 1:
The patent implements a dynamic search window mechanism where the search window size and position are adjusted based on the cursor pointer's current state and the results of previous searches. The search window expands when memory blocks are released and contracts when searching for specific block types, allowing the system to adapt search coverage to actual needs rather than always performing exhaustive searches, thus balancing search coverage and search time.
Solution Approach 2:
The system performs preliminary actions by maintaining cursor pointers that track the state of memory blocks in advance. When memory blocks are released, the cursor pointers are updated beforehand, so that when a search is initiated, the system can quickly identify available blocks without having to scan the entire memory space, thereby reducing search time while maintaining adequate coverage.
Data Source
AI summary
A method, computer program product, and computing system for maintaining a first cursor pointer for a memory system, wherein the first cursor pointer concerns a first search criteria and identifies an initial first cursor starting location; receiving a first search request for the memory system that satisfies the first search criteria; executing the first search request within an initial first search window starting at the initial first cursor starting location; and updating the first cursor pointer to identify an updated first cursor starting location based, at least in part, upon the initial first search window.