Disk Memory Ranking for LRU Information Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Large disk storage systems often lack sufficient memory to maintain LRU information for efficient caching, leading to inefficiencies in storing and retrieving content.
Innovation Solution
Implementing a system with multiple memory areas, each with a rank, where recently stored or accessed content is prioritized in the highest-ranked area, and older content is stored in lower-ranked areas, allowing for reassignment of ranks and deletion of least recently used content when the highest-ranked area reaches capacity, reducing memory requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If a single memory area is used to store all file segments, then content retrieval is simplified, but memory requirements increase and LRU information cannot be maintained for large disks
Solution Approach 1:
The patent divides the single memory area into multiple memory areas (first memory area, second memory area, etc.), each capable of storing file segments. This segmentation allows the system to maintain LRU information across multiple partitions rather than requiring all LRU information to reside in one large memory area, thereby reducing the memory burden while preserving caching functionality.
Solution Approach 2:
The patent introduces a new dimension to memory management by organizing file segments across multiple memory areas with different ranks, rather than using a single flat memory structure. This dimensional approach allows the system to track usage patterns across areas and implement LRU replacement policies without requiring excessive memory resources in a single location.
2Productivity
If LRU information is maintained for all files on a large disk, then content retrieval efficiency is improved, but memory capacity is insufficient
Solution Approach 1:
Each memory area is designed to serve multiple functions: storing file segments, tracking usage information, and participating in LRU replacement decisions. This multi-functionality allows the system to maintain retrieval efficiency across the entire disk by distributing these responsibilities across multiple memory areas rather than requiring one large dedicated LRU memory structure.
Solution Approach 2:
The system changes the parameter of memory organization from a single large memory area to multiple smaller memory areas with assignable ranks. This parameter change enables the system to maintain LRU information for large disks by distributing the tracking burden across multiple areas, each managing a subset of the total file segments.
3Adaptability or versatility
If memory areas are reassigned when capacity is reached, then new content can be stored, but additional operations are required
Solution Approach 1:
The patent implements dynamic memory area management where the rank and function of memory areas can change over time. When the first memory area reaches capacity, it can be reassigned as a second memory area, and another area can become the new first memory area. This dynamic reassignment provides flexibility to adapt to changing storage needs while maintaining systematic control over the reassignment process.
Data Source
AI summary
Systems, methods, and computer-program products store file segments by receiving a first file segment, and storing the first file segment in a first memory area having a highest ranking. The first memory area is reassigned as a memory area having a next highest ranking when a second file segment is received and the first memory area has reached a maximum capacity. The second file segment is stored in another memory that is reassigned as the memory area having the highest ranking.