Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. A memory system, comprising: a memory device; a candidate logical block address (LBA) sensor suitable for detecting a start LBA of a sequential workload as a candidate LBA, and, when a ratio of the number of update blocks to a total sum of valid page decrease amounts is less than a first threshold value, caching the candidate LBA in a loop cache; and a garbage collector suitable for performing a garbage collection operation on a victim block, when the number of free blocks in the memory device is less than a second threshold value and greater than or equal to a third threshold value and a start LBA of a subsequent sequential workload is not the same as the cached candidate LBA.
2. The memory system of claim 1 , further comprising: a valid page counter suitable for counting the number of valid pages of each closed memory block in the memory device before and after a map update operation.
A memory system includes a memory device with multiple memory blocks, each containing multiple pages, and a controller configured to manage data storage and retrieval. The system tracks the number of valid pages in each closed memory block before and after a map update operation using a valid page counter. This counter helps monitor the state of memory blocks, ensuring accurate tracking of valid data during operations that modify the logical-to-physical address mapping. The system may also include a garbage collection mechanism that selects memory blocks for erasure based on the number of valid pages, improving efficiency by prioritizing blocks with fewer valid pages. The valid page counter provides real-time data to optimize memory management, reducing wear and improving performance. The system may further include a wear-leveling mechanism that distributes write operations evenly across memory blocks to extend the lifespan of the memory device. The controller may also perform error detection and correction to maintain data integrity. The valid page counter ensures that the system accurately reflects the state of memory blocks during map updates, preventing data loss and improving reliability.
3. The memory system of claim 1 , wherein the total sum of the valid page decrease amounts is obtained by summing all valid page decrease amounts calculated for each closed memory block.
A memory system is designed to manage data storage and retrieval in non-volatile memory devices, such as flash memory, where data is stored in blocks and pages. The system addresses the challenge of efficiently tracking and managing valid data pages within closed memory blocks to optimize storage utilization and performance. When a memory block is closed, the system calculates a valid page decrease amount for each closed block, representing the reduction in valid data pages due to operations like garbage collection or wear leveling. The system then sums these valid page decrease amounts across all closed blocks to determine the total reduction in valid pages. This aggregated value helps in assessing storage efficiency, predicting future storage needs, and optimizing memory management strategies. The system may also use this information to adjust data placement, prioritize block operations, or improve wear leveling algorithms. By tracking valid page reductions at the block level and summing them, the system ensures accurate monitoring of storage utilization and enhances overall memory performance.
4. The memory system of claim 3 , wherein each of the valid page decrease amount for each closed memory block represents a difference between the number of valid pages of the corresponding closed memory block counted after a map update operation and the number of valid pages of the corresponding closed memory block counted before the map update operation.
This technical summary describes a memory system designed to efficiently track and manage valid page data in non-volatile memory blocks, particularly during garbage collection or other memory management operations. The system addresses the challenge of accurately determining the number of valid pages in closed memory blocks after a map update operation, which is critical for optimizing storage efficiency and performance. The memory system includes a mechanism to calculate a "valid page decrease amount" for each closed memory block. This value represents the difference between the number of valid pages in a closed memory block after a map update operation and the number of valid pages in the same block before the map update. By tracking this difference, the system can precisely monitor changes in valid page counts, enabling more accurate garbage collection decisions and reducing unnecessary data movement. The system may also include a controller or processor that performs the map update operations and calculates the valid page decrease amounts. The memory blocks may be part of a flash memory device, such as NAND flash, where efficient management of valid pages is essential for maintaining performance and endurance. The described approach helps minimize write amplification and wear leveling by ensuring that only necessary data is moved during garbage collection, thereby extending the lifespan of the memory device. This solution is particularly useful in storage systems where accurate tracking of valid pages is required to optimize write and erase operations, such as solid-state drives (SSDs) and other non-volatile memory storage devices.
5. The memory system of claim 4 , wherein each of the update blocks is a closed memory block of which the valid page decrease amount is not 0.
A memory system is designed to manage data storage and retrieval in a non-volatile memory device, such as a flash memory or solid-state drive (SSD). The system addresses the challenge of efficiently handling data updates and maintaining performance while minimizing wear on the memory cells. A key aspect of the system involves organizing data into memory blocks, where each block contains multiple pages of data. The system tracks the validity of pages within these blocks to determine which blocks are eligible for updates or erasure. The memory system includes a mechanism for identifying and managing update blocks, which are memory blocks that have been closed and contain valid data pages. A closed memory block is one that is no longer open for further writes and has undergone a process to finalize its data. The system ensures that each update block has a non-zero valid page decrease amount, meaning that at least some pages within the block have been invalidated or marked for deletion. This condition helps the system prioritize blocks for garbage collection or other maintenance operations, ensuring efficient use of storage space and reducing unnecessary wear on the memory cells. By tracking the valid page decrease amount, the system can optimize the selection of blocks for erasure, improving overall performance and longevity of the memory device. The approach ensures that only blocks with a meaningful reduction in valid pages are considered for further processing, preventing premature erasure of blocks that still contain a high proportion of valid data. This method enhances the efficiency of data management in non-volatile memory systems.
6. The memory system of claim 1 , wherein the garbage collector performs a garbage collection operation on the victim block, when the number of the free blocks is less than the third threshold value.
A memory system includes a storage device with multiple blocks, each containing multiple pages for storing data. The system monitors the number of free blocks available for writing new data. When the number of free blocks falls below a predefined threshold, a garbage collection operation is triggered. During garbage collection, a victim block is selected, valid data from the victim block is relocated to another block, and the victim block is erased to free up space. This process helps maintain system performance by preventing excessive fragmentation and ensuring sufficient free blocks are available for future write operations. The system may also include additional thresholds to optimize garbage collection timing and efficiency, such as adjusting the frequency or aggressiveness of garbage collection based on system workload or available resources. The memory system may be part of a solid-state drive, flash memory, or other non-volatile storage devices where efficient space management is critical. The garbage collection mechanism ensures reliable and consistent performance by dynamically adapting to changing storage conditions.
7. The memory system of claim 1 , wherein the ratio of the number of the update blocks to the total sum of the valid page decrease amounts is obtained by dividing the number of the update blocks by the total sum of the valid page decrease amounts.
A memory system is designed to optimize storage efficiency by managing update blocks and valid page data. The system addresses the problem of inefficient storage utilization in memory devices, particularly in scenarios where frequent updates lead to fragmented data and wasted space. The invention calculates a ratio that quantifies the relationship between the number of update blocks and the total reduction in valid page data across the memory system. This ratio is derived by dividing the count of update blocks by the cumulative sum of valid page decrease amounts. The update blocks represent segments of memory that have been modified or rewritten, while the valid page decrease amounts reflect the reduction in valid data size after updates or deletions. By analyzing this ratio, the system can assess storage efficiency, identify areas for optimization, and improve overall memory management. The invention ensures that the memory system dynamically adjusts to changing data patterns, reducing overhead and enhancing performance. This approach is particularly useful in solid-state drives (SSDs) and other non-volatile memory systems where efficient data handling is critical. The system's ability to track and analyze these metrics enables proactive management of storage resources, minimizing waste and maximizing capacity utilization.
8. The memory system of claim 1 , wherein each of the closed memory blocks has at least one valid page and is not an open block where a program operation is performed.
The invention relates to memory systems, specifically non-volatile memory systems such as flash memory, and addresses the challenge of efficiently managing memory blocks to improve performance and longevity. In such systems, memory blocks are organized into open blocks, where active programming operations occur, and closed blocks, which are no longer being written to but may still contain valid data. The invention focuses on optimizing the handling of closed memory blocks to enhance system efficiency. The memory system includes a controller that manages memory blocks, ensuring that each closed block contains at least one valid page of data and is not an open block undergoing a program operation. This distinction is critical for operations like garbage collection, where invalid or obsolete data is cleared to free up space. By ensuring closed blocks meet these criteria, the system avoids unnecessary wear on memory cells and reduces the overhead associated with managing partially written blocks. The controller may also track the status of each block to prevent conflicts between programming and garbage collection processes, thereby improving overall system reliability and performance. The invention helps extend the lifespan of the memory system by minimizing unnecessary write and erase cycles while maintaining data integrity.
9. The memory system of claim 1 , wherein each of the free blocks is a memory block having a number of empty pages greater than or equal to a threshold value.
A memory system is designed to manage data storage in non-volatile memory devices, such as flash memory, by efficiently organizing and tracking memory blocks. The system addresses the challenge of optimizing storage utilization and performance by dynamically identifying and managing free blocks, which are memory blocks with a sufficient number of empty pages available for writing new data. Each free block is defined as a memory block containing a number of empty pages that meets or exceeds a predefined threshold value. This threshold ensures that only blocks with adequate free space are considered available for data storage operations, preventing inefficient use of memory resources. The system may also include mechanisms for monitoring block usage, reclaiming partially filled blocks, and redistributing data to maintain optimal storage efficiency. By dynamically adjusting the threshold value based on system conditions, the memory system can adapt to varying workloads and storage demands, improving overall performance and longevity of the memory device. This approach helps balance write amplification, wear leveling, and garbage collection processes, ensuring reliable and efficient data storage operations.
10. The memory system of claim 1 , wherein the garbage collector performs the garbage collection operation by copying a valid data of the victim block into an empty page of a target block.
The memory system is designed to manage data storage and retrieval in non-volatile memory, particularly addressing the challenge of efficiently reclaiming storage space occupied by invalid or obsolete data. The system includes a garbage collector that identifies blocks of memory containing a mix of valid and invalid data, referred to as victim blocks, and reclaims these blocks by consolidating valid data into new locations while discarding invalid data. The garbage collector performs this operation by copying valid data from the victim block into an empty page of a target block, which is a previously unused or newly allocated block. This process ensures that valid data is preserved while freeing up the entire victim block for future use. The system may also include mechanisms to track the validity of data, manage the allocation of target blocks, and optimize the garbage collection process to minimize performance overhead and maximize storage efficiency. The approach is particularly useful in flash memory and solid-state drives, where frequent write-erase cycles necessitate efficient garbage collection to maintain performance and longevity.
11. A method for operating a memory system, comprising: detecting a start logical block address (LBA) of a sequential workload as a candidate LBA, and, when a ratio of the number of update blocks to a total sum of valid page decrease amounts is less than a first threshold value, caching the candidate LBA in a loop cache; and performing a garbage collection operation on a victim block when the number of free blocks in a memory device is less than a second threshold value and greater than or equal to a third threshold value and a start LBA of a subsequent sequential workload is not the same as the cached candidate LBA.
This invention relates to memory system management, specifically optimizing garbage collection and caching for sequential workloads in storage devices. The problem addressed is inefficient handling of sequential data access patterns, which can lead to unnecessary garbage collection operations and degraded performance. The method involves detecting the start logical block address (LBA) of a sequential workload and designating it as a candidate LBA. If the ratio of update blocks to the total sum of valid page decrease amounts is below a first threshold, the candidate LBA is cached in a loop cache. This caching helps prioritize frequently accessed sequential data. When free blocks in the memory device fall below a second threshold but remain above or equal to a third threshold, a garbage collection operation is triggered. However, this operation is only performed on a victim block if the start LBA of a subsequent sequential workload does not match the cached candidate LBA. This ensures that ongoing sequential workloads are not disrupted by garbage collection, improving system efficiency and performance. The thresholds are dynamically adjusted to balance between maintaining free space and minimizing unnecessary operations.
12. The method of claim 11 , further comprising: counting the number of valid pages of each of closed memory blocks in the memory device before and after a map update operation.
A method for managing memory in a storage device involves tracking the number of valid pages within closed memory blocks before and after a map update operation. The technique is used in non-volatile memory systems, such as flash memory, where efficient data management is critical to performance and longevity. The problem addressed is the need to accurately monitor the state of memory blocks to optimize wear leveling, garbage collection, and other maintenance operations. The method includes counting the number of valid pages in each closed memory block before performing a map update operation, which typically involves updating metadata or address mappings in the memory device. After the map update, the count is repeated to determine changes in the number of valid pages. This comparison helps assess the impact of the map update on the memory blocks, ensuring that the operation does not inadvertently corrupt data or leave blocks in an inconsistent state. By tracking valid pages before and after the update, the system can verify the integrity of the memory blocks and make informed decisions about further maintenance tasks, such as erasing or reallocating blocks. This approach improves reliability and efficiency in memory management, particularly in systems where frequent updates and wear leveling are necessary. The method is applicable to various memory technologies, including NAND flash, where precise tracking of valid data is essential for long-term performance.
13. The method of claim 11 , wherein the total sum of the valid page decrease amounts is obtained by summing all valid page decrease amounts calculated for each closed memory block.
A method for managing memory in a computing system addresses the problem of efficiently reclaiming memory space by reducing fragmentation and optimizing storage utilization. The method involves tracking memory blocks, identifying closed blocks that are no longer in use, and calculating valid page decrease amounts for each closed block. These decrease amounts represent the memory that can be reclaimed from the closed blocks. The total sum of these valid page decrease amounts is obtained by summing the individual decrease amounts calculated for all closed memory blocks. This summation provides a comprehensive measure of the total memory that can be reclaimed, enabling the system to efficiently manage memory allocation and deallocation. The method ensures that only valid decrease amounts are considered, preventing errors from invalid or corrupted data. By aggregating the decrease amounts from all closed blocks, the system can accurately determine the total available memory for reuse, improving overall system performance and resource utilization. The method is particularly useful in systems where memory fragmentation is a concern, such as in virtual memory environments or large-scale data processing systems.
14. The method of claim 13 , wherein the valid page decrease amount for each closed memory block represents a difference between the number of valid pages of the corresponding closed memory block counted after a map update operation and the number of valid pages of the corresponding closed memory block counted before the map update operation.
This invention relates to memory management in storage systems, specifically tracking valid pages in closed memory blocks during map update operations. The problem addressed is efficiently determining the number of valid pages in closed memory blocks after a map update, which is crucial for garbage collection and wear leveling in flash memory systems. The method involves calculating a valid page decrease amount for each closed memory block. This decrease amount represents the difference between the number of valid pages in a closed memory block after a map update operation and the number of valid pages in the same block before the map update. The map update operation typically involves updating a logical-to-physical address mapping table, which can change the validity status of pages in the memory blocks. By tracking this difference, the system can accurately assess how many valid pages remain in each closed memory block after the update. This information is used to optimize garbage collection processes, where invalid pages are reclaimed, and to manage wear leveling, ensuring even usage of memory blocks to prolong the lifespan of the storage device. The method improves efficiency by avoiding unnecessary reads of memory blocks and reduces computational overhead in determining valid page counts.
15. The method of claim 14 , wherein each of the update blocks is a closed memory block of which the valid page decrease amount is not 0.
A system and method for managing memory updates in a storage device involves tracking and processing update blocks to optimize storage efficiency. The technology addresses the challenge of efficiently handling memory updates in storage systems, particularly in scenarios where frequent updates lead to fragmented or inefficient memory usage. The method includes identifying and processing update blocks, which are segments of memory that have been modified or updated. Each update block is a closed memory block, meaning it is no longer being actively modified, and it has a non-zero valid page decrease amount, indicating that the block contains data that can be consolidated or reclaimed to free up storage space. The system processes these update blocks to reduce fragmentation, improve storage utilization, and enhance performance by consolidating valid data and reclaiming unused space. The method may involve merging update blocks, relocating data, or marking blocks for garbage collection, depending on the specific storage system and its requirements. By focusing on closed memory blocks with a non-zero valid page decrease amount, the system ensures that only relevant and reclaimable blocks are processed, minimizing unnecessary operations and improving overall efficiency.
16. The method of claim 11 , wherein a garbage collection operation is performed on the victim block, when the number of the free blocks is less than the third threshold value.
A method for managing memory in a storage system addresses the challenge of efficiently reclaiming storage space when available free blocks are insufficient. The system monitors the number of free blocks and triggers a garbage collection operation on a victim block when this number falls below a predefined threshold. The victim block is selected based on criteria such as wear leveling, data validity, or other optimization factors. During garbage collection, valid data from the victim block is relocated to a new block, and the victim block is erased to free up space. This process ensures that the storage system maintains sufficient free blocks for future write operations while minimizing performance degradation. The method may also incorporate additional thresholds or conditions to balance between proactive and reactive garbage collection, optimizing both storage efficiency and system performance. By dynamically adjusting garbage collection based on free block availability, the system avoids unnecessary operations when free space is abundant while ensuring timely reclamation when storage pressure increases. This approach is particularly useful in solid-state storage devices where write amplification and endurance are critical concerns.
17. The method of claim 11 , wherein the ratio of the number of the update blocks to the total sum of the valid page decrease amounts is obtained by dividing the number of the update blocks by the total sum of the valid page decrease amounts.
A method for managing data storage in a memory system addresses the challenge of efficiently tracking and optimizing storage utilization. The method involves calculating a ratio to assess the efficiency of data updates within the storage system. Specifically, the ratio is determined by dividing the number of update blocks by the total sum of valid page decrease amounts. This calculation helps evaluate how effectively storage space is being reclaimed during data updates. The method is part of a broader system for monitoring and improving storage efficiency, where update blocks represent segments of data that have been modified or rewritten, and valid page decrease amounts quantify the reduction in used storage space after updates. By analyzing this ratio, the system can identify opportunities to optimize storage allocation, reduce fragmentation, and enhance overall performance. The technique is particularly useful in solid-state drives (SSDs) and other non-volatile memory systems where efficient space management is critical for maintaining speed and reliability. The method ensures that storage resources are used optimally, minimizing wasted space and improving the longevity of the storage medium.
18. The method of claim 11 , wherein each of the closed memory block has at least one valid page and is not an open block where a program operation is performed.
A method for managing memory blocks in a storage system addresses the challenge of efficiently handling memory blocks that contain valid data while avoiding interference with ongoing program operations. The method focuses on closed memory blocks, which are defined as blocks that are not currently being written to (i.e., no program operation is in progress) and contain at least one valid page of data. These blocks are distinguished from open blocks, which are actively being written to. The method ensures that only closed blocks with valid data are selected for operations such as garbage collection, wear leveling, or data migration, thereby preventing disruptions to active write operations. By tracking the state of each block (open or closed) and verifying the presence of valid pages, the system optimizes memory management, reduces unnecessary operations, and maintains system performance. The approach improves efficiency by avoiding the selection of blocks that are either fully invalid or currently in use for writing, ensuring that only suitable blocks are processed. This method is particularly useful in flash memory systems where efficient block management is critical for performance and longevity.
19. The method of claim 11 , wherein each of the free blocks is a memory block having a number of empty pages greater than or equal to a threshold value.
A method for managing memory blocks in a storage system addresses the problem of inefficient memory allocation and fragmentation. The method involves identifying and utilizing free memory blocks that meet specific criteria to optimize storage operations. Each free block is defined as a memory block containing a number of empty pages that is greater than or equal to a predefined threshold value. This ensures that only sufficiently large free blocks are selected for allocation, reducing fragmentation and improving storage efficiency. The method may include steps such as scanning memory to identify free blocks, evaluating their size based on the threshold, and allocating or reallocating these blocks as needed. By focusing on blocks with a minimum number of empty pages, the system avoids excessive fragmentation and ensures better utilization of available storage space. This approach is particularly useful in systems where memory allocation and deallocation occur frequently, such as in databases or file systems, where maintaining contiguous free space is critical for performance. The threshold value can be dynamically adjusted based on system requirements or usage patterns to further optimize memory management.
20. The method of claim 11 , wherein the garbage collection operation is performed by copying a valid data of the victim block into an empty page of a target block.
A method for managing data storage in a memory system addresses the problem of efficiently reclaiming storage space by performing garbage collection operations. The method involves selecting a victim block containing both valid and invalid data, then copying only the valid data from the victim block into an empty page of a target block. This process ensures that only necessary data is transferred, reducing the overhead associated with garbage collection. The target block is prepared to receive the valid data, which may involve erasing or marking pages as available before the transfer. After copying, the victim block is erased or marked as free, making its storage space available for future use. This approach optimizes storage utilization by minimizing the number of data transfers and reducing the time required for garbage collection operations. The method is particularly useful in flash memory systems where block-level operations are common, as it efficiently handles wear leveling and data retention by selectively copying only valid data. The technique improves system performance by reducing the frequency of full block erasures and minimizing the impact of garbage collection on overall system operations.
Unknown
August 18, 2020
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.