# US 2024/0265982 A1 · Background reads for solid state storage

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

- Number: US 2024/0265982 A1
- Document ID: US20240265982A1
- Status: Published application
- Kind: A1
- Application number: 18/623,342
- Filed: 2024-04-01
- Published: 2024-08-08
- Earliest claimed: 2017-01-13
- Assignees: Pure Storage, Inc.
- Applicants: Pure Storage, Inc.
- Inventors: HARI KANNAN; ROBERT LEE; YUHONG MAO
- Web page: https://patentgrep.com/patent/US20240265982A1

## CPC

- G11C 16/3427: {Circuits or methods to prevent or reduce disturbance of the state of a memory cell when neighbouring cells are read or written}
- G01R 31/3171: {BER [Bit Error Rate] test}
- G06F 11/076: {by exceeding a count or rate limit, e.g. word- or bit count limit}
- G06F 11/108: {Parity data distribution in semiconductor storages, e.g. in SSD}
- G06F 11/1435: {using file system or storage system metadata}
- G06F 21/79: in semiconductor storage media, e.g. directly-addressable memories
- G11C 11/402: with charge regeneration individual to each memory cell, i.e. internal refresh
- G11C 16/26: Sensing or reading circuits; Data output circuits
- G11C 16/3418: {Disturbance prevention or evaluation; Refreshing of disturbed memory data}
- G11C 16/3495: {Circuits or methods to detect or delay wearout of nonvolatile EPROM or EEPROM memory devices, e.g. by counting numbers of erase or reprogram cycles, by using multiple memory areas serially or cyclically}
- H04L 1/20: using signal quality detector
- G06F 11/2058: {using more than 2 mirrored copies}
- G06F 13/1605: {based on arbitration (arbitration in handling access to a common bus or bus system G06F13/36)}
- G06F 2201/84: Using snapshots, i.e. a logical point-in-time copy of the data
- G11C 16/0483: {comprising cells having several storage transistors connected in series}
- G11C: STATIC STORES (semiconductor memory devices H10B)
- G01R: MEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES (indicating correct tuning of resonant circuits H03J3/12)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method for processing blocks of flash memory to decrease raw bit errors from the flash memory is provided. The method includes identifying one or more blocks of the flash memory for a refresh operation and writing information regarding the identified blocks, to a data structure. The method includes issuing background reads to the identified blocks, according to the data structure, as the refresh operation. The method may be embodied on a computer readable medium. In some embodiments the background reads may be based on a time based refresh responsive to an increase in raw bit error count in the flash memory over time.

## Claims

### Claim 1

A method, comprising:
identifying solid state storage within a storage node for a refresh operation, the identifying executed through a computing device external to the solid state storage;
writing information associated with the identified solid state storage as directed by the computing device; and
cycling background reads of the identified solid state storage, wherein data values read during the background reads are disregarded.

### Claim 2 (depends on 1)

The method of claim 1, wherein the identifying comprises:
determining an inode of a file, responsive to receiving a request to read the file;
determining portions of data belonging to the inode of the file; and
determining a location within the solid state storage that include the portions of data.

### Claim 3 (depends on 1)

The method of claim 1, wherein the information is written to non volatile random access memory (NVRAM).

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
writing information associated with the identified solid state storage to a data structure; and
arbitrating among read operations for data, write operations for data, background maintenance operations, erase operations, and the background reads.

### Claim 5 (depends on 1)

The method of claim 1, further comprising:
performing the cycling within a time interval, and wherein the time interval is adaptive.

### Claim 6 (depends on 1)

The method of claim 1 wherein the information associated with the identified solid state storage is distributed over a plurality of blades.

### Claim 7 (depends on 1)

The method of claim 1, wherein a time interval for cycling the background reads is modified according to changes in a raw bit error count associated with the identified solid state storage.

### Claim 8 (depends on 1)

The method of claim 1, further comprising:
distributing the background reads to a plurality of channels communicating with the solid state storage, wherein the plurality of channels has arbitration of read operations for data, write operations for data, background maintenance operations, erase operations, and the background reads.

### Claim 9

A tangible, non-transitory, computer-readable media having instructions thereupon which, when executed by a processor, cause the processor to perform a method comprising:
identifying solid state storage within a storage node for a refresh operation, the processor external to the solid state storage;
writing information associated with the identified solid state storage; and
cycling background reads of the identified solid state storage, wherein data values read during the background reads are disregarded.

### Claim 10 (depends on 9)

The computer-readable media of claim 9, wherein the identifying comprises:
determining an inode of a file, responsive to receiving a request to read the file;
determining portions of data belonging to the inode of the file; and
determining a location within the solid state storage that include the portions of data.

### Claim 11 (depends on 9)

The computer-readable media of claim 9, further comprising:
writing information associated with the identified solid state storage to a data structure; and
arbitrating among read operations for data, write operations for data, background maintenance operations, erase operations, and the background reads.

### Claim 12 (depends on 9)

The computer-readable media of claim 9, wherein the information is written to non volatile random access memory (NVRAM).

### Claim 13 (depends on 9)

The computer-readable media of claim 9, further comprising:
performing the cycling within a time interval, and wherein the time interval is adaptive.

### Claim 14 (depends on 9)

The computer-readable media of claim 9, wherein a time interval for cycling the background reads is modified according to changes in a raw bit error count associated with the identified solid state storage.

### Claim 15 (depends on 9)

The computer-readable media of claim 9, further comprising:
distributing the information associated with the solid state storage to a plurality of blades.

### Claim 16 (depends on 9)

The computer-readable media of claim 9, further comprising:
distributing the background reads to a plurality of channels communicating with the solid state storage, wherein the plurality of channels has arbitration of read operations for data, write operations for data, background maintenance operations, erase operations, and the background reads.

### Claim 17

A system, comprising:
solid state memory within a storage node;
one or more processors external to the solid state memory, the one or more processors configured to identify portions of the solid state memory for a refresh operation and the one or more processors configured to write writing information associated with the identified solid state storage, and the one or more processors configured to cycle background reads of the identified portions according to the information as the refresh operation, wherein data values read during the background reads are disregarded.

### Claim 18 (depends on 17)

The system of claim 17, wherein the information is written to non volatile random access memory (NVRAM).

### Claim 19 (depends on 17)

The system of claim 17, wherein the information associated with the identified solid state storage is written to a data structure, and wherein the system arbitrates among read operations for data, write operations for data, background maintenance operations, erase operations, and the background reads.

### Claim 20 (depends on 17)

The system of claim 17, wherein cycling the background read is within a time interval, and wherein the time interval is adaptive.
