IP Library Patent Application 14964168
Patent Application
App. No. 14/964,168

MEMORY SYSTEM AND THE OPERATION METHOD THEREOF

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 None
App. No.
14/964,168
Abstract

A system includes a memory device including a plurality of blocks and a controller suitable for controlling the memory device. The controller creates a k-dimensional array from the plurality of the blocks, where k is greater than 2, and selects best candidate blocks from the k-dimensional array with respect to the k metrics. The k-dimensional array includes 2-dimensional linked list arrays.

Claims (41)

1 . A system comprising:

a memory device including a plurality of blocks, each of the blocks having k metrics; and

a controller suitable for controlling the memory device,

wherein the controller is suitable for:

creating a k-dimensional array from the plurality of the blocks, where k is greater than 2; and

selecting best candidate blocks from the k-dimensional array with respect to the k metrics,

wherein the k-dimensional array includes 2-dimensional linked list arrays.

2 . The system of claim 1 , wherein each of the 2-dimensional arrays includes a first dimension and a second dimension, and

the controller is further suitable for placing and sorting the plurality of blocks such that the first dimension has strong ordering on a first metric of the k metrics and the second dimension has weak ordering on a second metric of the k metrics.

3 . The system of claim 2 , wherein the controller creates the k-dimensional array by:

placing the blocks into the k-dimensional array according to the first metric; and

sorting the blocks within each of the dimensions.

4 . The system of claim 3 , wherein the controller places the blocks into the k-dimensional array according to the first metric in the order of coordinates of the first dimension and the second dimension.

5 . The system of claim 3 , wherein the controller sorts the blocks within each of the dimensions by fixing coordinates of other dimensions.

6 . The system of claim 2 , wherein the controller is suitable for selecting a best candidate block with respect to the second metric by going through a subset of blocks with coordinates of the first dimension and the second dimension with respect to the second metric.

7 . The system of claim 2 , wherein the controller is further suitable for selecting a conditional best candidate block with respect to the second metric around a certain value of the first metric.

8 . The system of claim 2 , wherein the controller is further suitable for inserting a new block into the k-dimensional array such that the k-dimensional array remains ordered.

9 . The system of claim 2 , wherein the controller is further suitable for deleting a certain block in the k-dimensional array such that the k-dimensional array remains ordered.

10 . The system of claim 1 , wherein the k metrics include at least one of program-erase (PE) counts, the number of valid pages and sequence numbers.

11 . A method comprising:

creating a k-dimensional array from a plurality of the blocks of a memory device, each of the blocks having k metrics, where k is greater than 2; and

selecting best candidate blocks from the k-dimensional array with respect to the k metrics,

wherein the k-dimensional array includes 2-dimensional linked list arrays.

12 . The method of claim 11 , wherein each of the 2-dimensional arrays includes a first dimension and a second dimension, and

the method further includes placing and sorting the plurality of blocks such that the first dimension has strong ordering on a first metric of the k metrics and the second dimension has weak ordering on a second metric of the k metrics.

13 . The method of claim 12 , wherein the creating of the k-dimensional array from the plurality of the blocks comprises:

placing the blocks into the k-dimensional array according to the first metric; and

sorting the blocks within each of the dimensions.

14 . The method of claim 13 , wherein the placing of the blocks into the k-dimensional array comprises:

placing the blocks into the k-dimensional array according to the first metric in the order of coordinates of the first dimension and the second dimension.

15 . The method of claim 13 , wherein the sorting of the blocks comprises:

sorting the blocks within each of the dimensions by fixing coordinates of other dimension.

16 . The method of claim 12 , wherein the selecting of the best candidate blocks comprises:

selecting a best candidate block with respect to the second metric by going through a subset of blocks with coordinates of the first dimension and the second dimension with respect to the second metric.

17 . The method of claim 12 , further comprising:

selecting a conditional best candidate block with respect to the second metric around a certain value of the first metric.

18 . The method of claim 12 , further comprising:

inserting a new block into the k-dimensional array such that the k-dimensional array remains ordered.

19 . The method of claim 12 , further comprising:

deleting a certain block in the k-dimensional array such that the k-dimensional array remains ordered.

20 . The method of claim 11 , wherein the k metrics include at least one of program-erase (PE) counts, the number of valid pages and sequence numbers.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 15, 2017
From: SK HYNIX MEMORY SOLUTIONS INC.
To: SK HYNIX INC.
Reel/Frame 044899/0443 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 30, 2015
From: ZHANG, FAN; PIGNATELLI, DAVID J.; LIM, YU CHIN FABIAN
To: SK HYNIX MEMORY SOLUTIONS INC.
Reel/Frame 037384/0871 →