US6876579B2 - Method writing data to a large block of a flash memory cell - Google Patents

Method writing data to a large block of a flash memory cell Download PDF

Info

Publication number
US6876579B2
US6876579B2 US10/632,927 US63292703A US6876579B2 US 6876579 B2 US6876579 B2 US 6876579B2 US 63292703 A US63292703 A US 63292703A US 6876579 B2 US6876579 B2 US 6876579B2
Authority
US
United States
Prior art keywords
block
data
page
memory cell
flash memory
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime, expires
Application number
US10/632,927
Other versions
US20050030791A1 (en
Inventor
Chu-Cheng Liang
Chee-Kong Awyong
Khein-Seng Pua
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Phison Electronics Corp
Original Assignee
Phison Electronics Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Phison Electronics Corp filed Critical Phison Electronics Corp
Priority to US10/632,927 priority Critical patent/US6876579B2/en
Assigned to PHISON ELECTRONICS CORP. reassignment PHISON ELECTRONICS CORP. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: AWYONG, CHEE-KONG, LIANG, CHU-CHENG, PUA, KHEIN-SENG
Publication of US20050030791A1 publication Critical patent/US20050030791A1/en
Application granted granted Critical
Publication of US6876579B2 publication Critical patent/US6876579B2/en
Adjusted expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
    • G06F12/023—Free address space management
    • G06F12/0238—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory
    • G06F12/0246—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory in block erasable memory, e.g. flash memory
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/72—Details relating to flash memory management
    • G06F2212/7203—Temporary buffering, e.g. using volatile buffer or dedicated buffer blocks

Definitions

  • the present invention relates to a method of writing data to a large block of a flash memory cell, and more particularly relates to a method of writing data to a large block of a flash memory cell in which the data can be written continuously to a page even when the change of data is unable fully fill up the whole page.
  • NAND flash memory cell As the demand for NAND flash memory cell in the market is increasing, the productivity and the process technology are also upgraded accordingly, such as the development of new type of NAND flash memory cell, for example, a large block flash memory cell, a MLC flash memory cell and the like. And as technology is improved, the unit price of the flash memory cell is getting lower and lower.
  • the data storage or data retrieval of each page of the flash memory cell can be implemented only once at a time, and writing the data to the flash memory cell is limited by a sequence of operation, thus the processing speed of writing data to the flash memory cell is obviously reduced correspondingly.
  • the method of storing and retrieving data from the NAND flash memory cell can be generally described as follows.
  • the controller picks one block from the preset back up blocks in the flash memory cell and use it as a buffer 11 , and writes the unchanged data into the block 12 of the flash memory cell from the first page of the block 12 in an orderly manner, page by page to the buffer 11 .
  • the changed data in the block 12 is enough to fill up a whole page, then the data will be written into the buffer 11 page by page according to the page number.
  • the processor uses the data 13 of the original block 12 to fill up the remaining free space and write to the buffer 11 .
  • the above conventional data writing method can only move data from the original block to fill up the remaining free space when the space in the page is not completely filled up when data change occurs, and when the data is not written continuously, writing speed will be significantly slow.
  • an electronic device such as a computer, which uses this type of flash memory cell, the calculation and processing speed will be significantly reduced.
  • the present inventor makes a detailed study of related art to evaluate and consider, and uses years of accumulated experience in this field, and through several experiments, to create a new method of writing data to the high speed large block of flash memory cell.
  • the processor when the processor writes data to the flash memory cell, if the changed data can not fill up the whole page, the processor will pick a block from one of the backed up blocks in the flash memory cell using as a special block for storing changed data temporarily, and continue to write the next changed data into the special block until whole space in the page is filled up.
  • the data stored temporarily in the special block is moved to a buffer of the backed up block and then the special block is erased so that it can be used as a back up block, thus when writing data to flash memory cell, even when the change of data is unable fully fill up the whole page, the changed data still can be written continuously, and therefore the writing speed can be substantially increased.
  • FIG. 1 is a block diagram ( 1 ) of a conventional data writing method
  • FIG. 2 is a block diagram ( 2 ) of the conventional data writing method
  • FIG. 3 is a block diagram ( 3 ) of the conventional data writing method
  • FIG. 4 is a block diagram ( 4 ) of the conventional data writing method
  • FIG. 5 is a block diagram ( 1 ) of a data writing method of the present invention.
  • FIG. 6 is a block diagram ( 2 ) of the data writing method of the present invention.
  • FIG. 7 is a block diagram ( 3 ) of the data writing method of the present invention.
  • FIG. 8 is a block diagram ( 4 ) of the data writing method of the present invention.
  • FIG. 9 is a block diagram ( 5 ) of the data writing method of the present invention.
  • FIG. 10 is a block diagram ( 6 ) of the data writing method of the present invention.
  • FIG. 11 is a block diagram ( 7 ) of the data writing method of the present invention.
  • FIG. 12 is a block diagram ( 8 ) of the data writing method of the present invention.
  • the present invention relates to a method of writing data to the high speed large block of flash memory cell.
  • the processor When the processor writes data to the flash memory cell, if data changed is unable completely fill the page, the processor will pick a block from the back up blocks of the flash memory cell as the special block for writing the changed data into the special block for temporarily storage until the page is completely filled, and then the temporarily stored data from the special block is moved to one of the buffer of the back up block. Next, the special block is erased to serve as a back up block. Therefore, even when the changed data is unable to completely fill the page, the changed data can still be written continuously to substantially increase the writing speed.
  • a block is picked to use as a buffer 51 from the preset back up blocks of the flash memory cell, and the unchanged data is written to the block 52 of the flash memory cell from the first page of the block 52 and the unchanged data is moved in an orderly manner according to the page numbers, page by page to the buffer 51 .
  • the changed data in the block 52 is sufficient to completely fill a page, then the changed data is written page by page according to the page numbers to the buffer 51 .
  • whether the next set of data is the continuation of the changed data is judged. If yes, then whether the set of data and the temporary data stored in the special block 53 is sufficient to completely fill the page is judged. If yes, the temporarily stored data is retrieved from the special block 53 and organized together with the set of data for filling up the page then written to the buffer 51 , and then the special block 53 is erased for serving as a back up block. If not (i.e. if the set of data and the temporary data stored in the special block 53 is sufficient to completely fill the page), writing of the data to the special block 53 is continued, and the writing action will be repeated until the page is completely filled. When the page is completely full, then the temporary stored data is retrieved from the special block 53 and the set of data for filling up the page are organized and then the data is written to the buffer 51 , and then the special block 53 is erased to serve as a back up block.
  • next set of data is a continuation of the changed data
  • the above procedure is repeated, writing the data page by page to the buffer 51 until the page is completely full, then the original block 52 is erased for serving as a back up block and the block 52 is replaced by the buffer 51 to repeat the above procedure.
  • the stored data is read from the special block 53 , and the changed data in the block 52 is organized to fill up the remaining free space 54 and then the data is written to the buffer 51 .
  • the special block 53 is erased to serve as a back up block for further writing the unchanged data below the changed data in the block 52 page by page in a orderly manner according to the page number until completely filling the page, and then the original block 52 is erased to serve as a back up block, and the block 52 is replaced by the buffer 51 to repeat the above procedure.
  • the method of writing data to the flash memory cell of the present invention can continue writing data even when the data change is unable completely fill the page. Accordingly, the data writing speed can be increased substantially.

Abstract

A method of writing data to a large block of a flash memory cell is disclosed. When the processor writes data to the flash memory cell, if the changed data can not fill up the whole page, the processor will pick a block from one of the backed up blocks in the flash memory cell using as a special block for storing changed data temporarily, and continue to write the next changed data into the special block until whole space in the page is filled up. When the page is completely filled, then the data stored temporarily in the special block is moved to a buffer of the backed up block and then the special block is erased so that it can be used as a back up block, thus when writing data to flash memory cell, even when the change of data is unable fully fill up the whole page, the changed data still can be written continuously, and therefore the writing speed can be substantially increased.

Description

BACKGROUND OF THE INVENTION
    • 1. The field of the invention
The present invention relates to a method of writing data to a large block of a flash memory cell, and more particularly relates to a method of writing data to a large block of a flash memory cell in which the data can be written continuously to a page even when the change of data is unable fully fill up the whole page.
2. Description of the Related Art
As the demand for NAND flash memory cell in the market is increasing, the productivity and the process technology are also upgraded accordingly, such as the development of new type of NAND flash memory cell, for example, a large block flash memory cell, a MLC flash memory cell and the like. And as technology is improved, the unit price of the flash memory cell is getting lower and lower. However, during the operation, the data storage or data retrieval of each page of the flash memory cell can be implemented only once at a time, and writing the data to the flash memory cell is limited by a sequence of operation, thus the processing speed of writing data to the flash memory cell is obviously reduced correspondingly.
The method of storing and retrieving data from the NAND flash memory cell can be generally described as follows.
Referring to FIG. 1, the controller picks one block from the preset back up blocks in the flash memory cell and use it as a buffer 11, and writes the unchanged data into the block 12 of the flash memory cell from the first page of the block 12 in an orderly manner, page by page to the buffer 11.
Referring to FIG. 2, if the changed data in the block 12 is enough to fill up a whole page, then the data will be written into the buffer 11 page by page according to the page number.
Referring to FIG. 3, if the changed data in the block 12 is insufficient to fill up a whole page, the processor uses the data 13 of the original block 12 to fill up the remaining free space and write to the buffer 11.
Furthermore, referring to FIG. 4, writing the unchanged data below the changed data in the block 12 in an orderly manner, page by page to the buffer 11 until writing of data in of the all pages is completed, then the original block 12 is erased to serve as a back up block, and the original block 12 replaced by the buffer 11.
However, the above conventional data writing method can only move data from the original block to fill up the remaining free space when the space in the page is not completely filled up when data change occurs, and when the data is not written continuously, writing speed will be significantly slow. In an electronic device, such as a computer, which uses this type of flash memory cell, the calculation and processing speed will be significantly reduced.
SUMMARY OF THE INVENTION
Accordingly, in the view of the foregoing, the present inventor makes a detailed study of related art to evaluate and consider, and uses years of accumulated experience in this field, and through several experiments, to create a new method of writing data to the high speed large block of flash memory cell.
According to one major aspect of the present invention, when the processor writes data to the flash memory cell, if the changed data can not fill up the whole page, the processor will pick a block from one of the backed up blocks in the flash memory cell using as a special block for storing changed data temporarily, and continue to write the next changed data into the special block until whole space in the page is filled up. When the page is completely filled, then the data stored temporarily in the special block is moved to a buffer of the backed up block and then the special block is erased so that it can be used as a back up block, thus when writing data to flash memory cell, even when the change of data is unable fully fill up the whole page, the changed data still can be written continuously, and therefore the writing speed can be substantially increased.
BRIEF DESCRIPTION OF THE DRAWING
For a more complete understanding of the present invention, reference will now be made to the following detailed description of preferred embodiments taken in conjunction with the accompanying drawings, in which:
FIG. 1 is a block diagram (1) of a conventional data writing method;
FIG. 2 is a block diagram (2) of the conventional data writing method;
FIG. 3 is a block diagram (3) of the conventional data writing method;
FIG. 4 is a block diagram (4) of the conventional data writing method;
FIG. 5 is a block diagram (1) of a data writing method of the present invention;
FIG. 6 is a block diagram (2) of the data writing method of the present invention;
FIG. 7 is a block diagram (3) of the data writing method of the present invention;
FIG. 8 is a block diagram (4) of the data writing method of the present invention;
FIG. 9 is a block diagram (5) of the data writing method of the present invention;
FIG. 10 is a block diagram (6) of the data writing method of the present invention;
FIG. 11 is a block diagram (7) of the data writing method of the present invention; and
FIG. 12 is a block diagram (8) of the data writing method of the present invention.
 DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS
Reference will be made in detail to the preferred embodiments of the invention, examples of which are illustrated in the accompanying drawings. Wherever possible, the same reference numbers are used in the drawings and the description to refer to the same or like parts.
The present invention relates to a method of writing data to the high speed large block of flash memory cell. When the processor writes data to the flash memory cell, if data changed is unable completely fill the page, the processor will pick a block from the back up blocks of the flash memory cell as the special block for writing the changed data into the special block for temporarily storage until the page is completely filled, and then the temporarily stored data from the special block is moved to one of the buffer of the back up block. Next, the special block is erased to serve as a back up block. Therefore, even when the changed data is unable to completely fill the page, the changed data can still be written continuously to substantially increase the writing speed.
In a preferred embodiment of the present invention, referring to FIG. 5, a block is picked to use as a buffer 51 from the preset back up blocks of the flash memory cell, and the unchanged data is written to the block 52 of the flash memory cell from the first page of the block 52 and the unchanged data is moved in an orderly manner according to the page numbers, page by page to the buffer 51.
Referring to FIG. 6, if the changed data in the block 52 is sufficient to completely fill a page, then the changed data is written page by page according to the page numbers to the buffer 51.
Furthermore, referring to FIG. 7, whether the changed data in the block 52 is insufficient to completely fill a page is judged, then a block is picked to serve as a special block 53 from the back up blocks and the changed data is written to the special block 53 for temporary storage.
Referring to FIGS. 8, 9 and 10, whether the next set of data is the continuation of the changed data is judged. If yes, then whether the set of data and the temporary data stored in the special block 53 is sufficient to completely fill the page is judged. If yes, the temporarily stored data is retrieved from the special block 53 and organized together with the set of data for filling up the page then written to the buffer 51, and then the special block 53 is erased for serving as a back up block. If not (i.e. if the set of data and the temporary data stored in the special block 53 is sufficient to completely fill the page), writing of the data to the special block 53 is continued, and the writing action will be repeated until the page is completely filled. When the page is completely full, then the temporary stored data is retrieved from the special block 53 and the set of data for filling up the page are organized and then the data is written to the buffer 51, and then the special block 53 is erased to serve as a back up block.
Additionally, referring to FIG. 11, if the next set of data is a continuation of the changed data, the above procedure is repeated, writing the data page by page to the buffer 51 until the page is completely full, then the original block 52 is erased for serving as a back up block and the block 52 is replaced by the buffer 51 to repeat the above procedure.
Referring to FIG. 12, if the next set of data is not the continuation of the changed data, the stored data is read from the special block 53, and the changed data in the block 52 is organized to fill up the remaining free space 54 and then the data is written to the buffer 51. Next, the special block 53 is erased to serve as a back up block for further writing the unchanged data below the changed data in the block 52 page by page in a orderly manner according to the page number until completely filling the page, and then the original block 52 is erased to serve as a back up block, and the block 52 is replaced by the buffer 51 to repeat the above procedure.
The method of writing data to the flash memory cell of the present invention can continue writing data even when the data change is unable completely fill the page. Accordingly, the data writing speed can be increased substantially.
While the invention has been described in conjunction with a specific best mode, it is to be understood that many alternatives, modifications, and variations will be apparent to those skilled in the art in light of the foregoing description. Accordingly, it is intended to embrace all such alternatives, modifications, and variations in which fall within the spirit and scope of the included claims. All matters set forth herein or shown in the accompanying drawings are to be interpreted in an illustrative and non-limiting sense.

Claims (3)

1. A method of writing data to a large block of a flash memory cell, the method comprising:
picking a block from a preset back up blocks of said flash memory cell to serve as a buffer;
writing an unchanged data page by page in an orderly manner according to the page number to said buffer from a first page of said block of said flash memory cell;
judging whether a changed data in said block is sufficient to completely fill a page, then writing said data to said buffer page by page in an orderly manner according to the page number;
judging whether said changed data in said block is sufficient to completely fill a page, then randomly picking a block from said back up blocks to serve as a special block for writing the remaining data thereof;
judging whether the next set of data is a continuation of said changed data, wherein if said next set of data is not the continuation of said changed data, said data stored in said special block is read and the remaining part of said page is filled up with said data in said block for writing to said buffer, and said special block is erased to serve as a back up block, and wherein said unchanged data is written below the changed data in said block page by page in an orderly manner according the page number until completely fill up said page, and wherein the original block is erased to serve as a back up block and said block is replaced by said buffer.
2. The method according to claim 1, wherein when said next set of data is a continuation of said changed data, whether said next set of data together with said data stored in said special block is sufficient to completely fill the page is judged, wherein if yes, said data stored in said special block together with said next set of data are organized and written to said buffer and said special block is erased to serve as a back up block, and the above steps are repeated until said page is completely filled up, then said data from said special block is read and organized with said next set of data and written to said buffer, and then the special block is erased to serve as a back up block.
3. The method according to claim 2, wherein when the next set of data is a continuation of said changed data, then writing operation of said data to said buffer repeated in an orderly manner page by page until the last page of said block is completely filled, and then said original block is erased to serve as a back up block and said block is replaced by said buffer.
US10/632,927 2003-08-04 2003-08-04 Method writing data to a large block of a flash memory cell Expired - Lifetime US6876579B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US10/632,927 US6876579B2 (en) 2003-08-04 2003-08-04 Method writing data to a large block of a flash memory cell

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US10/632,927 US6876579B2 (en) 2003-08-04 2003-08-04 Method writing data to a large block of a flash memory cell

Publications (2)

Publication Number Publication Date
US20050030791A1 US20050030791A1 (en) 2005-02-10
US6876579B2 true US6876579B2 (en) 2005-04-05

Family

ID=34115809

Family Applications (1)

Application Number Title Priority Date Filing Date
US10/632,927 Expired - Lifetime US6876579B2 (en) 2003-08-04 2003-08-04 Method writing data to a large block of a flash memory cell

Country Status (1)

Country Link
US (1) US6876579B2 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080183918A1 (en) * 2007-01-31 2008-07-31 Microsoft Corporation Extending flash drive lifespan
US20100095083A1 (en) * 2007-03-06 2010-04-15 Microsoft Corporation Selectively utilizing a plurality of disparate solid state storage locations
JP2016099949A (en) * 2014-11-26 2016-05-30 インターナショナル・ビジネス・マシーンズ・コーポレーションＩｎｔｅｒｎａｔｉｏｎａｌ Ｂｕｓｉｎｅｓｓ Ｍａｃｈｉｎｅｓ Ｃｏｒｐｏｒａｔｉｏｎ Meta-information writing method, meta-information reading method, file management system, computer system, program, and data structure

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2004310972A (en) * 2003-03-25 2004-11-04 Ricoh Co Ltd Information processor, information recording device, information processing system, information recording method, program for recording information and storage medium
CN101176074B (en) * 2005-12-09 2010-12-15 松下电器产业株式会社 Nonvolatile memory device, method of writing data, and method of reading out data
KR100866959B1 (en) * 2007-02-13 2008-11-05 삼성전자주식회사 Partial page data write method of non-volatile memory device
US7962683B2 (en) * 2007-08-15 2011-06-14 Silicon Motion, Inc. Flash memory, and method for operating a flash memory
TWI385519B (en) * 2008-04-18 2013-02-11 Phison Electronics Corp Data writing method, and flash storage system and controller using the same
TWI398770B (en) * 2008-07-08 2013-06-11 Phison Electronics Corp Data accessing method for flash memory and storage system and controller using the same
CN102956267B (en) * 2011-08-30 2016-04-27 旺宏电子股份有限公司 Memory programming method and apply its flash memory device
JP5799699B2 (en) * 2011-09-15 2015-10-28 富士ゼロックス株式会社 Power supply control device, management control device, image processing device, power supply control program

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6058047A (en) * 1996-08-16 2000-05-02 Tokyo Electron Limited Semiconductor memory device having error detection and correction
US6754115B2 (en) * 2001-10-29 2004-06-22 Mitsubishi Denki Kabushiki Kaisha Nonvolatile semiconductor memory device with backup memory block

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6058047A (en) * 1996-08-16 2000-05-02 Tokyo Electron Limited Semiconductor memory device having error detection and correction
US6754115B2 (en) * 2001-10-29 2004-06-22 Mitsubishi Denki Kabushiki Kaisha Nonvolatile semiconductor memory device with backup memory block

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080183918A1 (en) * 2007-01-31 2008-07-31 Microsoft Corporation Extending flash drive lifespan
US8560760B2 (en) 2007-01-31 2013-10-15 Microsoft Corporation Extending flash drive lifespan
US20100095083A1 (en) * 2007-03-06 2010-04-15 Microsoft Corporation Selectively utilizing a plurality of disparate solid state storage locations
US8126939B2 (en) 2007-03-06 2012-02-28 Microsoft Corporation Selectively utilizing a plurality of disparate solid state storage locations
US9535625B2 (en) 2007-03-06 2017-01-03 Bohdan Raciborski Selectively utilizing a plurality of disparate solid state storage locations
JP2016099949A (en) * 2014-11-26 2016-05-30 インターナショナル・ビジネス・マシーンズ・コーポレーションＩｎｔｅｒｎａｔｉｏｎａｌ Ｂｕｓｉｎｅｓｓ Ｍａｃｈｉｎｅｓ Ｃｏｒｐｏｒａｔｉｏｎ Meta-information writing method, meta-information reading method, file management system, computer system, program, and data structure
US10282427B2 (en) 2014-11-26 2019-05-07 International Business Machines Corporation Metadata storing technique

Also Published As

Publication number Publication date
US20050030791A1 (en) 2005-02-10

Similar Documents

Publication Publication Date Title
KR100977899B1 (en) Method and apparatus for effectively enabling an out of sequence write process within a non-volatile memory system
US9075740B2 (en) Memory system
US8843691B2 (en) Prioritized erasure of data blocks in a flash storage device
US7702880B2 (en) Hybrid mapping implementation within a non-volatile memory system
KR101202620B1 (en) Non-volatile memory and method with multi-stream updating
US8904090B2 (en) Non-volatile memory device, devices having the same, and method of operating the same
US8949507B2 (en) Method for performing block management, and associated memory device and controller thereof
JP5002201B2 (en) Memory system
EP2112599A1 (en) Scheduling of housekeeping operations in flash memory systems
EP1729304A1 (en) Space management for managing high capacity nonvolatile memory
US20100077132A1 (en) Memory devices and access methods thereof
JP4977703B2 (en) Non-volatile memory with scheduled playback operation
KR20070101261A (en) Non-volatile memory and method with multi-stream update tracking
KR20070102504A (en) Non-volatile memory and method with improved indexing for scratch pad and update blocks
US6876579B2 (en) Method writing data to a large block of a flash memory cell
US20090164745A1 (en) System and Method for Controlling an Amount of Unprogrammed Capacity in Memory Blocks of a Mass Storage System
CN104700896B (en) Storage system and user apparatus including the storage system
US8429339B2 (en) Storage device utilizing free pages in compressed blocks
JP2013235630A (en) Control device, storage device, and data writing method
CN103389942A (en) Control device, storage device, and storage control method
CN105988719B (en) Storage device and its method for handling data
KR100914646B1 (en) Management Scheme for Flash Memory with the Multi-Plane Architecture
CN113885808A (en) Mapping information recording method, memory control circuit unit and memory device
US10824340B2 (en) Method for managing association relationship of physical units between storage area and temporary area, memory control circuit unit, and memory storage apparatus
EP1558989A2 (en) Method and apparatus for resolving physical blocks associated with a common logical block

Legal Events

Date Code Title Description
AS Assignment

Owner name: PHISON ELECTRONICS CORP., TAIWAN

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:LIANG, CHU-CHENG;AWYONG, CHEE-KONG;PUA, KHEIN-SENG;REEL/FRAME:014368/0254

Effective date: 20030721

STCF Information on status: patent grant

Free format text: PATENTED CASE

FPAY Fee payment

Year of fee payment: 4

FEPP Fee payment procedure

Free format text: PAT HOLDER NO LONGER CLAIMS SMALL ENTITY STATUS, ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: STOL); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

SULP Surcharge for late payment
FPAY Fee payment

Year of fee payment: 8

FPAY Fee payment

Year of fee payment: 12