Adaptive Memory Partitioning for Fragmented Data Storage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing file systems face inefficiencies in memory storage due to sequential block allocation, leading to cumbersome management of fragmented data files and wasted space, as files are created, modified, or deleted, causing free space to become sporadically located on discs.
Innovation Solution
A file storage system with an adaptive partitioning mechanism that subdivides memory into segments and sub-segments of varying sizes to accommodate fragmented data files, using meta data to track and reconstruct the fragments, allowing for efficient storage and retrieval of data streams without wasting memory space.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If sequential block allocation is used to facilitate file reads and writes, then read/write efficiency is improved, but free space becomes sporadically located and management becomes cumbersome
Solution Approach 1:
The patent divides the storage space into fixed-size blocks that can be independently allocated and tracked. Each block is managed as a separate unit with its own allocation status, allowing efficient sequential allocation while maintaining simple tracking through block-level metadata rather than complex free space management.
2Loss of substance
If fixed-size blocks are used to minimize storage waste, then storage efficiency is improved, but fragmented files cannot be stored efficiently
Solution Approach 1:
The patent segments files into fixed-size blocks that can be stored in non-contiguous locations. Each block is independently managed, allowing fragmented files to be stored efficiently across different locations in storage while maintaining fixed block sizes to minimize waste. The system tracks block relationships through metadata to reconstruct the original file.
Solution Approach 2:
The patent introduces a logical dimension for file organization that is separate from physical storage location. Files are represented as sequences of block identifiers rather than continuous physical spaces, allowing fragmented storage while maintaining logical file structure. This dimensional separation enables efficient handling of fragmented files using fixed-size blocks.
3Productivity
If sequential block allocation is used, then long data streams can be processed efficiently, but the system becomes complex when files are created, modified, or deleted
Solution Approach 1:
The patent segments the file system into independent block units that can be allocated sequentially for efficient data stream processing. Each block maintains its own allocation state, simplifying the management of file creation, modification, and deletion operations. The sequential allocation of blocks enables efficient processing while the modular block structure reduces overall system complexity.
Data Source
AI summary
A file storage system can include a file manager that adaptively partitions memory to accommodate the storage of fragmented data information. The fragments, potentially of varying size, can be stored in a volume of memory that is partitioned to include a group of storage segments. In the event that a particular fragment is not sized to efficiently fit in a free storage segment, the segment can be further subdivided to accommodate a fragment. In this way, a segment allotted for storage of data information can be adaptively subdivided into a smaller group of storage sub-segments. These sub-segments and yet potentially smaller storage partitions of the sub-segments can then be used to store additional fragments of a related stream of data. Based on this technique, portions of a logical stream of data information can be stored in the segments that vary in size. Meta data associated with the stored fragments can be used to facilitate reconstruction of a file or data stream.