# US 2021/0334040 A1 · Aggressive intent write request cancellation

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

- Number: US 2021/0334040 A1
- Document ID: US20210334040A1
- Status: Published application
- Kind: A1
- Application number: 16/856,376
- Filed: 2020-04-23
- Published: 2021-10-28
- Earliest claimed: 2020-04-23
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Franco Vincent BORICH
- Web page: https://patentgrep.com/patent/US20210334040A1

## CPC

- G06F 3/0659: {Command handling arrangements, e.g. command buffers, queues, command scheduling}
- G06F 3/0689: {Disk arrays, e.g. RAID, JBOD}
- G06F 3/0604: {Improving or facilitating administration, e.g. storage management}
- G06F 3/0611: {in relation to response time}
- G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Methods and systems for aggressive intent write request cancellation are disclosed. A method includes: generating an entry for data creation and generating a data object in view of the entry. Further, the method includes sending intent write requests to write a plurality of slices of the data object into dispersed storage (DS) units and determining whether or not a threshold number of the plurality of slices have been written into the DS units. Additionally, the method includes canceling at least one queued intent write request of the intent write requests corresponding to at least one unwritten slice of the plurality of slices in response to determining that the threshold number of the plurality of slices have been written into the DS units.

## Claims

### Claim 1

A method, comprising:
generating, by a computing device, an entry for data creation;
generating, by the computing device, a data object in view of the entry;
sending, by the computing device, intent write requests to write a plurality of slices of the data object into dispersed storage (DS) units;
determining, by the computing device, whether or not a threshold number of the plurality of slices have been written into the DS units; and
canceling, by the computing device, at least one queued intent write request of the intent write requests corresponding to at least one unwritten slice of the plurality of slices in response to determining that the threshold number of the plurality of slices have been written into the DS units, wherein:
the canceling the at least one queued intent write request reduces a burden on a rebuilder module of a DS processing unit,
the rebuilder module is a background agent which checks a state of each DS unit of the DS units for rebuilding the data object, and
the burden is reduced on the rebuilder module by reducing an amount of the plurality of slices which need rebuilding.

### Claim 2 (depends on 1)

The method of claim 1, wherein the entry is an intent log entry that is an intent to generate the data object.

### Claim 3 (depends on 1)

The method of claim 1, wherein the determining that the threshold number of the plurality of slices have been written into the DS units includes receiving a threshold number of write confirmations indicating a slice is written into the DS units.

### Claim 4 (depends on 1)

The method of claim 1, further comprising determining that the threshold number of the plurality of slices have not been written into the DS units by receiving, by the computing device, a number of write confirmations less than a threshold number of write confirmations indicating a slice is written into the DS units.

### Claim 5 (depends on 1)

The method of claim 1, further comprising, receiving, by the computing device, user data which is written into the DS units by a user and separate from the entry.

### Claim 6 (depends on 5)

The method of claim 5, further comprising preserving the user data in response to the user data being written into the DS units.

### Claim 7 (depends on 1)

The method of claim 1, further comprising preserving the intent write requests for unwritten slices in response to determining that the threshold number of the plurality of slices have not been written into the DS units.

### Claim 8

A computer program product comprising one or more computer readable storage media having program instructions collectively stored on the one or more computer readable storage media, the program instructions executable to:
generate an entry for data creation;
generate a data object in view of the entry;
send intent write requests to write a plurality of slices of the data object into dispersed storage (DS) units;
determine that a threshold number of the plurality of slices have not been written into the DS units;
preserve at least one queued intent write request of the intent write requests corresponding to at least one unwritten slice of the plurality of slices in response to determining that the threshold number of the plurality of slices have not been written into the DS units; and
in response to determining that the threshold number of the plurality of slices have been written into the DS units, cancel the at least one queued intent write request, wherein:
the canceling the at least one queued intent write request reduces a burden on a rebuilder module of a DS processing unit,
the rebuilder module is a background agent which checks a state of each DS unit of the DS units for rebuilding the data object, and
the burden is reduced on the rebuilder module by reducing an amount of the plurality of slices which need rebuilding.

### Claim 9

(canceled)

### Claim 10 (depends on 8)

The computer program product of claim 8, wherein the entry is an intent log entry.

### Claim 11 (depends on 8)

The computer program product of claim 8, wherein the entry is an intent to generate the data object.

### Claim 12 (depends on 8)

The computer program product of claim 8, further comprising program instructions to preserve user data.

### Claim 13 (depends on 12)

The computer program product of claim 12, further comprising program instructions to discard the user data in response to a satisfaction of a resource pool threshold.

### Claim 14 (depends on 12)

The computer program product of claim 12, wherein the user data lives longer than the entry.

### Claim 15

A system comprising:
a processor, a computer readable memory, one or more computer readable storage media, and program instructions collectively stored on the one or more computer readable storage media, the program instructions executable to:
generate an entry for data creation;
generate a data object in view of the entry;
send intent write requests to write a plurality of slices of the data object into dispersed storage (DS) units;
determine whether or not a threshold number of the plurality of slices have been written into the DS units; and
cancel at least one queued intent write request of the intent write requests corresponding to at least one unwritten slice of the plurality of slices in response to a determining that the threshold number of the plurality of slices have been written into the DS units, wherein:
the canceling the at least one queued intent write request reduces a burden on a rebuilder module of a DS processing unit,
the rebuilder module is a background agent which checks a state of each DS unit of the DS units for rebuilding the data object, and
the burden is reduced on the rebuilder module by reducing an amount of the plurality of slices which need rebuilding.

### Claim 16 (depends on 15)

The system of claim 15, wherein the determining that the threshold number of the plurality of slices have been written into the DS units includes receiving a threshold number of write confirmations indicating a slice is written into the DS units.

### Claim 17 (depends on 15)

The system of claim 15, further comprising program instructions to preserve user data which is written into the DS units by a user.

### Claim 18 (depends on 15)

The system of claim 15, further comprising program instructions to discard user data written into the DS units by a user in response to satisfying a resource pool threshold of the DS units.

### Claim 19 (depends on 18)

The system of claim 18, wherein the user data is separate from the entry and has a longer life cycle than the entry.

### Claim 20 (depends on 15)

The system of claim 15, further comprising program instructions to preserve the intent write requests for unwritten slices in response to determining that the threshold number of the plurality of slices have not been written into the DS units.

### Claim 21 (depends on 1)

The method of claim 1, further comprising:
preserving user data written into the DS units until a resource pool utilization threshold is met;
separating the data object into the plurality of slices using a combination of erasure coding, encryption, and Information Dispersal Algorithms (IDAs); and
generating extra slices for the data object, wherein:
the resource pool utilization threshold is a number of the DS units utilized,
the slice is a dispersed piece of encoded data used to recreate the data object,
the data object is recreated from a subset of a total number of slices which includes the plurality of slices and the extra slices.
