Data storage device and flash memory control method
    1.
    发明授权
    Data storage device and flash memory control method 有权
    数据存储设备和闪存控制方法

    公开(公告)号:US09400746B2

    公开(公告)日:2016-07-26

    申请号:US14195118

    申请日:2014-03-03

    Inventor: Po-Chia Chu

    CPC classification number: G06F12/0246 G06F2212/7211

    Abstract: A FLASH memory control technique with wear leveling between the different blocks of the FLASH memory. By a controller managing the blocks of a FLASH memory within a data storage device, some of the blocks are pushed into a spare queue waiting to be allocated as data blocks or system blocks and some blocks are pushed into a jail queue to be inaccessible. When the jail queue is full and any block within the spare queue has an erase count greater than any block within the jail queue, for wear leveling between the different blocks within the FLASH memory, the controller releases a first block selected from the jail queue and pushes a second block selected from the spare queue into the jail queue.

    Abstract translation: FLASH存储器控制技术,其在FLASH存储器的不同块之间具有磨损均衡。 通过控制器管理数据存储设备内的FLASH存储器的块,一些块被推入等待被分配为备用队列的数据块或系统块,并且一些块被推入监视队列以使其不可访问。 当监狱队列已满并且备用队列内的任何块的擦除次数大于监视队列内的任何块时,对于FLASH存储器内的不同块之间的磨损均衡,控制器释放从监视队列中选择的第一块, 将从备用队列中选择的第二个块推入监视队列。

    Data storage device and flash memory control method

    公开(公告)号:US09720820B2

    公开(公告)日:2017-08-01

    申请号:US14255165

    申请日:2014-04-17

    CPC classification number: G06F12/0246 G06F2212/7211

    Abstract: A FLASH memory control technique with wear leveling between the different blocks of the FLASH memory. By a controller managing the blocks of a FLASH memory within a data storage device, some of the blocks are pushed into a spare queue waiting to be allocated as data blocks or system blocks. When the number of blocks within the spare queue is lower than a clean threshold and any block within the spare queue has an erase count greater than an overused lower threshold, the controller performs a garbage correction operation with wear leveling between the different blocks.

    Data-storage device and data maintenance method thereof

    公开(公告)号:US10296231B2

    公开(公告)日:2019-05-21

    申请号:US15863889

    申请日:2018-01-06

    Abstract: The present invention provides a data storage device including a flash memory and a controller. The controller receives a read command arranged to read data from a host, determines a plurality of read tasks by analyzing the read command, and determines task time of each of the read tasks according to the number of the read tasks and an I/O latency time. In a first read task of the read tasks, the controller reads a part of the data and transmits the read part to the host, and executes a first maintenance process according to a predetermined condition, wherein the predetermined condition includes a remain time and the remain time is the task time minus the time spent by the first read task.

    Garbage collection method for flash memory
    4.
    发明授权
    Garbage collection method for flash memory 有权
    闪存的垃圾收集方法

    公开(公告)号:US09292432B2

    公开(公告)日:2016-03-22

    申请号:US14452767

    申请日:2014-08-06

    CPC classification number: G06F12/0246 G06F2212/7211

    Abstract: A garbage collection method for a flash memory is provided. The flash memory includes a spare block pool and a data block pool, wherein the spare block pool includes spare blocks and the data block pool includes data blocks. The method includes the steps of: receiving target data from a host and writing the target data to a current data block of the data blocks; sorting an erase count of each data block when performing a wear-leveling process to write the target data; sorting a valid page number of each first block when it is determined that at least two first blocks in the data blocks have the smallest erase count; and selecting a second block having a smallest valid page number from the first blocks and writing valid pages of the second block to one of the spare blocks to perform a data cleaning process.

    Abstract translation: 提供了一种用于闪速存储器的垃圾回收方法。 闪速存储器包括备用块池和数据块池,其中备用块池包括备用块,并且数据块池包括数据块。 该方法包括以下步骤:从主机接收目标数据并将目标数据写入数据块的当前数据块; 当执行磨损均衡处理以写入目标数据时对每个数据块的擦除计数进行排序; 当确定数据块中的至少两个第一块具有最小擦除次数时,排序每个第一块的有效页码; 以及从所述第一块中选择具有最小有效页码的第二块,并将所述第二块的有效页写入所述备用块中的一个以执行数据清理处理。

Patent Agency Ranking