# US 2010/0169543 A1 · Recovery for non-volatile memory after power loss

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2010/0169543 A1
- Document ID: US20100169543A1
- Status: Published application
- Kind: A1
- Application number: 12/347,935
- Filed: 2008-12-31
- Published: 2010-07-01
- Earliest claimed: 2008-12-31
- Assignees: Micron Technology, Inc.
- Inventors: Joseph Edgington; Hisham Chowdhury
- Web page: https://patentgrep.com/patent/US20100169543A1

## CPC

- G06F 12/0246: {in block erasable memory, e.g. flash memory}
- G06F 3/064: {Management of blocks}
- G06F 3/0679: {Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]}
- G06F 12/1009: using page tables, e.g. page table structures
- G11C 16/102: {External programming circuits, e.g. EPROM programmers; In-circuit programming or reprogramming; EPROM emulators}
- G06F 2212/7202: Allocation control and policies
- G06F 2212/7209: Validity control, e.g. using flags, time stamps or sequence numbers
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G11C: STATIC STORES (semiconductor memory devices H10B)

## Abstract

Non-volatile memory array can be recovered after a power loss. In one example, pages of a memory array are scanned to find a first free page after the power loss. The first free page is marked as available, and the page marked as available is written to with the next write cycle

## Claims

### Claim 1

A method comprising:
scanning pages of a memory array to find a first free page;
marking the first free page as available; and
writing to the page marked as available with the next write cycle.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
marking the page prior to the first free page as invalid; and
erasing the page marked as invalid.

### Claim 3 (depends on 1)

The method of claim 1, wherein scanning pages comprises scanning pages in an order in which they are written to and determining whether a page has data stored in it and if the page does not have data stored in it, then determining that the next page is the first free page.

### Claim 4 (depends on 3)

The method of claim 3, wherein scanning pages further comprises if the page does have data stored in it, then determining whether the page is marked as valid and if the page is not marked as valid, then determining that the next page is the first free page.

### Claim 5 (depends on 4)

The method of claim 4, wherein determining whether a page is marked as valid comprises reading a header associated with the page.

### Claim 6 (depends on 5)

The method of claim 5, wherein reading a header comprises reading a header for a block of pages.

### Claim 7 (depends on 5)

The method of claim 5, wherein reading a header comprises reading a header in a spare area of the memory array that is associated with the page.

### Claim 8 (depends on 1)

The method of claim 1, wherein marking as invalid comprises writing a marker into a header associated with the page.

### Claim 9 (depends on 1)

The method of claim 1, wherein marking as invalid comprises writing a marker into a header associated with a block of pages containing the first free page.

### Claim 10 (depends on 1)

The method of claim 1, wherein marking as valid comprises writing to a look up table associated with the first free page.

### Claim 11 (depends on 1)

The method of claim 1, wherein the memory array is divided into blocks, each block containing multiple pages, wherein scanning pages comprises scanning pages of a block, the method further comprising:
scanning pages of each other block to find a first free page in each block;
marking the page before the first free page in each block as invalid; and
marking the first free page as available in each block.

### Claim 12

A power loss recovery system for a memory array comprising:
a page scanner to scan pages of a memory array to find a first free page;
a page marker to mark the first free page as available; and
program circuitry to write to the page marked as available with the next write cycle.

### Claim 13 (depends on 12)

The system of claim 12, wherein the page marker is further to mark the page prior to the first free page as invalid, and wherein the program circuitry is further to erase the page marked as invalid.

### Claim 14 (depends on 12)

The system of claim 12, wherein page scanner finds a free page by determines whether a page is marked as valid in a header associated with the page.

### Claim 15 (depends on 5)

The system of claim 5, wherein reading a header comprises reading a header for a block of pages.

### Claim 16

A memory device comprising:
a memory cell array comprising a plurality of memory cells, the cells being grouped into a plurality of blocks; and
a memory controller coupled to the memory cell array to scan pages of a memory array to find a first free page, mark the page prior to the first free page as invalid, mark the first free page as available, erase the page marked as invalid, and write to the page marked as available.

### Claim 17 (depends on 16)

The device of claim 16, wherein the memory controller scans pages in an order in which they are written to and determines whether a page has data stored in it and if the page does not have data stored in it, then determines that the next page is the first free page.

### Claim 18 (depends on 17)

The device of claim 17, wherein if the page does have data stored in it, then the memory controller determines whether the page is marked as valid and if the page is not marked as valid, then determines that the next page is the first free page.

### Claim 19 (depends on 16)

The device of claim 16, wherein the memory cell array is a flash memory cell array.

### Claim 20 (depends on 16)

The device of claim 16, wherein the memory cell array is a phase change memory cell array.
