IP Library Granted Patent US 11,954,021
Granted Patent B2
US 11,954,021 · App. 18/075,698 · Granted Apr 9, 2024

Storage device and operating method thereof

Inventors: Sung Jin Park (Gyeonggi-do, KR); Jee Yul Kim (Gyeonggi-do, KR)
Assignee: SK hynix Inc.
G06F12/0246G06F3/0614G06F3/0631G06F3/064G06F3/0652G06F3/0679G06F12/0253G06F12/0891G06F2212/7201
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,954,021
App. No.
18/075,698
Granted
Apr 9, 2024
Kind
B2
Abstract

The present disclosure relates to a storage device. The storage device includes a memory device including write-completed blocks storing data and free blocks each containing no data and a memory controller controlling the memory device to perform a garbage collection operation to store valid data stored in a victim block, among the write-completed blocks, in one of the free blocks based on the number of map segments including mapping information between logical addresses and physical addresses of the valid data, and erase counts of the free blocks.

Claims (18)

1. A method of operating a storage device comprising a memory device including write-completed blocks storing data and free blocks each containing no data and a memory controller controlling the memory device to perform a garbage collection operation, the method comprising:

determining a victim block on which to perform the garbage collection operation among the write-completed blocks;

determining an attribute of valid data stored in the victim block according to a result of comparing a number of map segments corresponding to the valid data with a threshold value, the map segments including mapping information between logical addresses and physical addresses of the valid data; and

storing the valid data to one of the free blocks based on erase counts of the free blocks and the attribute of the valid data.

2. The method of claim 1 , wherein the attribute of the valid data is determined to be random when the number of map segments corresponding to the valid data stored in the write-completed blocks exceeds the threshold value.

3. The method of claim 2 , wherein the determining the attribute of the valid data comprises,

allocating a free block having a smallest erase count, among the free blocks, as the target block in response to determining the attribute of the valid data to random.

4. The method of claim 2 , wherein the determining the attribute of the valid data comprises,

allocating a free block having a smallest erase count, among free blocks having erase counts less than a threshold count, as the target block in response to determining the attribute of the valid data to random.

5. The method of claim 1 , wherein the attribute of the valid data is determined to be sequential when the number of map segments corresponding to the valid data stored in the write-completed blocks is less than or equal to the threshold value.

6. The method of claim 5 , wherein the determining the attribute of the valid data comprises,

allocating a free block having a largest erase count, among the free blocks, as the target block in response to determining the attribute of the valid data to sequential.

7. The method of claim 5 , wherein the determining the attribute of the valid data comprises,

allocating a free block having a largest erase count, among free blocks having erase counts less than a threshold count, as the target block in response to determining the attribute of the valid data to sequential.

8. The method of claim 5 , wherein the determining the attribute of the valid data comprises,

calculating an average erase count of the free blocks and allocates one of free blocks having an erase count exceeding the average erase count as the target block in response to determining the attribute of the valid data to sequential.

9. The method of claim 1 , wherein the victim block is determined based on a size of the valid data stored in the write-completed blocks.

10. The method of claim 1 , wherein the victim block is a memory block storing a least amount of valid data among the write-completed blocks.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 7, 2024
From: SK HYNIX INC.
To: MIMIRIP LLC
Reel/Frame 067335/0246 →