The present invention relates to non-volatile memory, e.g., such as NAND Flash memory, and more specifically, this invention relates to a non-volatile memory system having an increased effective number of supported heat levels without increasing an associated number of blocks open for writing. 
Using Flash memory as an example, the performance characteristics of conventional NAND Flash-based solid state drives (SSDs) are fundamentally different from those of traditional hard disk drives (HDDs).  Data in conventional SSDs is typically organized in pages of 4, 8, or 16 KB sizes.  Moreover, page read operations in SSDs are typically one order of magnitude faster than write operations and latency neither depends on the current nor the previous location of operations. 
However, in Flash-based SSDs, memory locations are erased in blocks prior to being written to.  The size of a minimal erase unit (a block) is typically 256 pages and the erase operations takes approximately one order of magnitude more time than a page program operation.  Due to the intrinsic properties of NAND Flash, Flash-based SSDs write data out-of-place whereby a mapping table maps logical addresses of the written data to physical ones.  This mapping table is typically referred to as the Logical-to-Physical Table (LPT). 
As Flash based memory cells exhibit read errors and/or failures due to wear or other reasons, additional redundancy may be used within memory pages as well as across memory chips (e.g., RAID-5 and RAID-6 schemes).  The additional redundancy within memory pages may include error correction code (ECC) which, for example, may include BCH codes.  While the addition of ECC in pages is relatively straightforward, the organization of memory blocks into RAID-like stripes is more complex.  For instance, individual blocks are retired over time which requires either reorganization of the stripes, or capacity reduction of the stripe.  As the organization of stripes together with the LPT defines the placement of data, SSDs typically utilize a Log-Structured Array (LSA) architecture, which combines these two methods. 
The LSA architecture relies on out-of-face writes.  In this approach, a memory page overwrite will result in writing the memory page data to a new location in memory, marking the old copy of the memory page data as invalid, and then updating the mapping information.  Due to the limitations of current NAND memory technology, an invalidated data location cannot be reused until the entire block it belongs to has been erased.  Before erasing, though, the block undergoes garbage collection, whereby any valid data in the block is relocated to a new block.  Garbage collection of a block is typically deferred for as tong as possible to maximize the amount of invalidated data in block, and thus reduce the number of valid pages that are relocated, as relocating data causes additional write operations, and thereby increases write amplification.