A technique for selecting a block with the least erased counts to reduce time complexity and memory requirement for NAND flash memory

PURPOSE: A least deletion block search technique of a NAND flash memory is provided to reduce average processing time for allocating an empty block by reducing the number of accesses to a NAND flash memory. CONSTITUTION: The most deleted block is stored in a NAND flash memory. The deletion times and...

Full description

Saved in:
Bibliographic Details
Main Authors HA, KEON SOO, KIM, TAE JIN, KIM, JI HONG
Format Patent
LanguageEnglish
Korean
Published 13.06.2012
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online AccessGet full text

Cover

More Information
Summary:PURPOSE: A least deletion block search technique of a NAND flash memory is provided to reduce average processing time for allocating an empty block by reducing the number of accesses to a NAND flash memory. CONSTITUTION: The most deleted block is stored in a NAND flash memory. The deletion times and maximum deletion times of the block are compared(303). A low level erase block queue is searched in order to prevent the use of the block(307). A block allocation pointer is reset to a location of the block(309).
Bibliography:Application Number: KR20100122519