Efficient sub-block erasing

Abstract

Storage devices contain a memory array that comprises memory devices for storing data. These memory devices can be arranged in a configuration of blocks that group a number of memory devices together. Often, blocks are the smallest unit that can be erased, however various storage devices can divide blocks into sub-blocks which can operate as unique blocks themselves. These sub-blocks can be seen as regular blocks to the storage device or host computer. However, the time needed to erase these increased number of operational sub-blocks decreases overall performance as more erase time is needed. Devices and methods described herein decrease overall erase times within a sub-block memory array by checking the status of related sub-blocks before processing an erase request for a particular sub-block. Each of the related sub-blocks can be erased alongside the particular sub-block if the status of the related sub-blocks provides for erasure without losing host data.