IP Library Granted Patent US 8,554,986
Granted Patent B2
US 8,554,986 · App. 13/058,314 · Granted Oct 8, 2013

Device and method of controlling flash memory

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 8,554,986
App. No.
13/058,314
Granted
Oct 8, 2013
Kind
B2
Abstract

Disclosed is a flash memory controlling method and controlling device. The flash memory controlling method including calculating a cost for each of available block recycling schemes based on a multi-block erase function when the multi-block erase function is supported, the multi-block erase function being a function that simultaneously erases data stored in a plurality of blocks of a flash memory and selecting at least one scheme from among the available block recycling schemes based on the calculated cost, and managing at least one block using the at least one method selected from among the available block recycling schemes.

Claims (38)

1. A device for controlling a flash memory, the device comprising:

an erasing unit adapted to support a multi-block erase function that simultaneously erases data stored in a plurality of blocks of the flash memory; and

a managing unit adapted to manage at least one block of the plurality of blocks using at least one block recycling scheme from a plurality of preselected block recycling schemes when the multi-block erase function is supported, wherein the at least one block recycling scheme is selected based on a calculated cost for using the block recycling schemes in conjunction with the multi-block erase function.

2. The device of claim 1 , further comprising:

a cost calculating unit adapted to calculate the calculated cost for each of the plurality of preselected block recycling schemes in conjunction with the multi-block erase function; and

a selecting unit adapted to select the at least one block recycling scheme from the plurality of preselected block recycling schemes based on the calculated cost for using the plurality of preselected block recycling schemes in conjunction with the multi-block erase function.

3. The device of claim 2 , wherein the cost calculating unit calculates the calculated cost for each of the plurality of preselected block recycling schemes based on a number of the plurality of blocks where the multi-block erase function is applied.

4. The device of claim 2 , wherein the selecting unit selects the at least one block recycling scheme with a minimum cost from the plurality of preselected block recycling schemes.

5. The device of claim 1 , wherein the managing unit processes data of at least one invalid page included in the at least one block through using the selected at least one block recycling scheme from the plurality of preselected block recycling schemes.

6. The device of claim 1 , wherein the plurality of blocks include at least one data block or at least one log block.

7. The device of claim 1 , wherein the plurality of preselected block recycling schemes include at least one of an merge operation scheme, a switch operation scheme, a copy and switch operation scheme, a migration operation scheme, and a page erase and copy operation scheme.

8. The device of claim 1 , wherein the erasing unit supports a page unit erase function that selectively erases a plurality of pages included in each of the plurality of blocks of the flash memory.

9. A method for controlling a flash memory including a first block and a second block, the method comprising:

selectively erasing elimination target data recorded in at least one invalid page existing in the first block, wherein less than all pages in the first block are erased;

copying valid data recorded in at least one valid page existing in the second block to the at least one invalid page existing in the first block where the elimination target data is erased; and

erasing data recorded in a plurality of pages existing in the second block.

10. The method of claim 9 , wherein the selectively erasing of the elimination target data comprises:

copying data recorded in at least one valid page existing in the first block to at least one page existing in a third block when the data recorded in the at least one valid page existing in the first block has a possibility of being erased while performing the selectively erasing.

11. The method of claim 10 , wherein the copying of the valid data recorded in the at least one page existing in the second block further comprises:

copying data copied to the at least one page existing in the third block to the plurality of pages existing in the first block.

12. A non-transitory computer readable media storing a program for implementing a method of claim 11 .

13. A non-transitory computer readable media storing a program for implementing a method of claim 10 .

14. The method of claim 9 , wherein the erasing of the data simultaneously erases data recorded in the plurality of pages existing in the second block.

15. A non-transitory computer readable media storing a program for implementing a method of claim 12 .

16. A non-transitory computer readable media storing a program for implementing a method of claim 9 .

17. A method for controlling a flash memory device, the method comprising:

calculating a cost for each of a plurality of block recycling schemes based on a multi-block erase function when the multi-block erase function is supported, the multi-block erase function being a function that simultaneously erases data stored in a plurality of blocks of a flash memory;

selecting at least one block recycling scheme from among the plurality of block recycling schemes based on the calculated cost; and

managing at least one block of the plurality of blocks of the flash memory using the at least one block recycling scheme selected from the plurality of block recycling schemes.

18. The method of claim 17 , wherein the managing of the at least one block processes data of at least one invalid page included in the at least one block using the at least one block recycling scheme selected from the plurality of block recycling schemes.

19. A non-transitory computer readable media storing a program for implementing a method of claim 18 .

20. The method of claim 17 , wherein the calculating step calculates the calculated cost for each of the plurality of block recycling schemes based on a number of the plurality of blocks where the multi-block erase function is applied.

21. A non-transitory computer readable media storing a program for implementing a method of claim 20 .

22. The method of claim 17 , wherein the selecting of the at least one block recycling scheme selects the at least one block recycling scheme with a minimum cost from the plurality of block recycling schemes.

23. A non-transitory computer readable media storing a program for implementing a method of claim 22 .

24. The method of claim 17 , wherein the plurality of block recycling schemes include at least one of a merge operation scheme, a switch operation scheme, a copy and switch operation scheme, a migration operation scheme, and a page erase and copy operation scheme.

25. A non-transitory computer readable media storing a program for implementing a method of claim 24 .

26. A non-transitory computer readable media storing a program for implementing a method of claim 17 .

Assignments (14)
MERGER Recorded Jan 22, 2021
From: TOSHIBA MEMORY CORPORATION
To: K.K. PANGEA
Reel/Frame 055659/0471 →
CHANGE OF NAME AND ADDRESS Recorded Jan 22, 2021
From: K.K. PANGEA
To: TOSHIBA MEMORY CORPORATION
Reel/Frame 055669/0401 →
CHANGE OF NAME AND ADDRESS Recorded Jan 22, 2021
From: TOSHIBA MEMORY CORPORATION
To: KIOXIA CORPORATION
Reel/Frame 055669/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 22, 2017
From: TOSHIBA CORPORATION
To: TOSHIBA MEMORY CORPORATION
Reel/Frame 043620/0430 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 14, 2016
From: OCZ STORAGE SOLUTIONS, INC.
To: TOSHIBA CORPORATION
Reel/Frame 038434/0371 →
RELEASE OF SECURITY INTEREST BY BANKRUPTCY COURT ORDER (RELEASES REEL/FRAME 031611/0168) Recorded Apr 8, 2014
From: COLLATERAL AGENTS, LLC
To: OCZ TECHNOLOGY GROUP, INC.
Reel/Frame 032640/0455 →
RELEASE OF SECURITY INTEREST BY BANKRUPTCY COURT ORDER (RELEASES REEL/FRAME 030092/0739) Recorded Apr 8, 2014
From: HERCULES TECHNOLOGY GROWTH CAPITAL, INC.
To: OCZ TECHNOLOGY GROUP, INC.
Reel/Frame 032640/0284 →
CORRECTIVE ASSIGNMENT TO CORRECT THE EXECUTION DATE AND ATTACH A CORRECTED ASSIGNMENT DOCUMENT PREVIOUSLY RECORDED ON REEL 032365 FRAME 0920. ASSIGNOR(S) HEREBY CONFIRMS THE THE CORRECT EXECUTION DATE IS JANUARY 21, 2014. Recorded Mar 18, 2014
From: OCZ TECHNOLOGY GROUP, INC.
To: TAEC ACQUISITION CORP.
Reel/Frame 032461/0486 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 27, 2014
From: OCZ TECHNOLOGY GROUP, INC.
To: TAEC ACQUISITION CORP.
Reel/Frame 032365/0920 →
CHANGE OF NAME Recorded Feb 27, 2014
From: TAEC ACQUISITION CORP.
To: OCZ STORAGE SOLUTIONS, INC.
Reel/Frame 032365/0945 →
SECURITY AGREEMENT Recorded Nov 11, 2013
From: OCZ TECHNOLOGY GROUP, INC.
To: COLLATERAL AGENTS, LLC
Reel/Frame 031611/0168 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 15, 2013
From: INDILINX CO., LTD.
To: OCZ TECHNOLOGY GROUP, INC.
Reel/Frame 030798/0799 →
SECURITY AGREEMENT Recorded Mar 27, 2013
From: OCZ TECHNOLOGY GROUP, INC.
To: HERCULES TECHNOLOGY GROWTH CAPITAL, INC.
Reel/Frame 030092/0739 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 3, 2011
From: LEE, JONGMIN; LEE, DONGHEE; PARK, HANMOOK
To: INDILINX CO., LTD.
Reel/Frame 025898/0530 →