# US 2013/0159609 A1 · Processing unit reclaiming requests in a solid state memory device

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

- Number: US 2013/0159609 A1
- Document ID: US20130159609A1
- Status: Published application
- Kind: A1
- Application number: 13/707,639
- Filed: 2012-12-07
- Published: 2013-06-20
- Earliest claimed: 2011-12-15
- Assignees: International Business Machines Corporation
- Inventors: Robert Haas; Roman Pletka
- Web page: https://patentgrep.com/patent/US20130159609A1

## CPC

- G06F 12/0246: {in block erasable memory, e.g. flash memory}
- G06F 12/0253: {Garbage collection, i.e. reclamation of unreferenced memory}
- G06F 2212/7205: Cleaning, compaction, garbage collection, erase control
- Y02D 10/00: Energy efficient computing, e.g. low power processors, power management or thermal management
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- Y02D: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE

## Abstract

An apparatus and method for processing unit reclaiming requests in a solid state memory device. The present invention provides a method of managing a memory which includes a set of units. The method includes selecting a unit from the set of units having plurality of subunits. The method further includes determining a number of valid subunits m to be relocated from the units selected for a batch operation where m is at least 2. The selecting is carried out by a unit reclaiming process.

## Claims

### Claim 1

A method of managing a memory which includes a set of units, the method comprising the steps of:
selecting a unit from the set of units having plurality of subunits; and
determining a number of valid subunits m to be relocated from the units selected for a batch operation;
wherein the selecting is carried out by a unit reclaiming process; and
wherein m is at least two.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
writing data updates to outdated data;
wherein the data updates are written to the subunits so that the updated data is written to a different subunit from the subunit that contains the outdated data; and
wherein the subunit that contains the outdated data is an invalid subunit and the subunit that contains the updated data is a valid subunit.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
determining the number of the valid subunits m to be relocated in the batch operation based on at least one of:
a total number of valid subunits n contained in the selected unit;
a number of free units currently available; and
at lease one system parameter comprising at least one parameter selected from the group consisting of: a read operation, a write operation, an erase operation, and a queue operation for placing relocation requests for relocating the valid subunits m.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
determining a number of valid subunits n contained in the unit selected; and
relocating the valid subunits n by operating relocation requests for the valid subunits n in batches of size m in which the last batch to be relocated can be less than m subunits.

### Claim 5 (depends on 4)

The method of claim 4, wherein the step of operating relocation requests further comprises:
reading data from the subunit to be relocated according to a read request, wherein the read request is comprised within the relocation request; and
queuing the read requests for the m subunits to be relocated in a row for execution so that there is no another request in between the m read requests.

### Claim 6 (depends on 4)

The method of claim 4, wherein the step of operating relocation requests further comprises:
writing the data read from the subunit to be relocated according to a write request, wherein the write request is comprised within the relocation request; and
queuing the write request for execution when the associated read request is terminated, wherein the write request does not wait for the other read requests to be terminated.

### Claim 7 (depends on 1)

The method of claim 1, wherein selecting the unit for the reclamation if the number of free units is below a first threshold.

### Claim 8 (depends on 7)

The method of claim 7, further comprising:
relocating a determined number of valid subunits n from the unit selected for reclamation in the batch operation in batches of size m if the number of free units is below a second threshold, wherein the second threshold is lower than the first threshold.

### Claim 9 (depends on 7)

The method of claim 7, further comprising:
relocating a determined number of valid subunits n from the unit selected for reclamation one-by-one, so that the batch operation is not applied, if the number of free units is below the first threshold and above or equal to the second threshold.

### Claim 10 (depends on 1)

A non-transitory computer readable article of manufacture tangibly embodying computer readable instructions which, when executed, cause a computer to carry out the steps of a method according to claim 1.

### Claim 11

A memory controller for managing a memory, comprising:
a processor device configured:
to select a unit out of a set of units for reclamation by a unit reclaiming process, wherein a unit comprises a set of subunits; and
to determine a number of valid subunits m to be relocated from the selected unit for a batch operation, wherein m is at least two.

### Claim 12 (depends on 11)

The memory controller of claim 11, wherein the memory comprises the unit of the set of units which is erasable as a whole by the unit reclaiming process resulting in a free unit available for writing data.

### Claim 13 (depends on 11)

The memory controller of claim 11, wherein the memory controller is a channel controller, comprising:
a memory having multiple dies; and
a bus which connects the multiple dies;
wherein a die comprises multiple units.

### Claim 14 (depends on 13)

The memory controller of claim 13, wherein the memory controller is adapted to write data that has been read from the subunit to be relocated to a subunit of the same channel wherein the channel includes a same die as the die which the subunit is read from.

### Claim 15 (depends on 13)

The memory controller of claim 13, wherein the memory controller is adapted to write data that has been read to the subunit to be relocated to a subunit of a different channel wherein the channel that includes a different die from a die that the subunit is read from.

### Claim 16 (depends on 11)

The memory controller of claim 11, further comprising:
a first queue and a second queue, wherein the first queue and the second queue are adapted to hold requests to be executed; and
a scheduler for selecting requests that are waiting in the first queue and the second queue for execution, wherein the scheduler is adapted to prioritize the requests that are waiting in the first queue over the requests waiting in the second queue;
wherein the first queue is adapted to queue unit reclaiming requests; and
wherein the second queue is adapted to queue user requests.

### Claim 17 (depends on 11)

The memory controller of claim 11, comprising:
a first queue and a second queue, wherein the first queue and the second queue are adapted to hold requests to be executed; and
a scheduler for selecting requests that are waiting in the first queue and the second queue for execution according to a first and a second threshold, wherein the second threshold is below the first threshold;
wherein the memory controller is adapted to queue:
unit reclaiming requests in the second queue if a number of free units available is between the first threshold and the second threshold; and
unit reclaiming requests in the first queue if the number of free units is below the second threshold.

### Claim 18

A storage device, comprising:
a memory;
a memory controller for managing the memory;
a set of erasable units erasable by a unit reclaiming process to form a free unit;
wherein the unit comprises a set of subunits, wherein data updates are performed by writing data updates to the subunits so that the updated data is written to a subunit that is different from the subunit that contained the outdated data;
wherein the subunit that contains the outdated data is an invalid subunit; and
wherein the subunit containing the updated data is a valid subunit.

### Claim 19 (depends on 18)

The storage device according to claim 18, further comprising:
multiple channels having multiple dies; and
a bus that connects the memory controller to the multiple dies.
