# US 2018/0024887 A1 · Writing encoded data slices in a dispersed storage network

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

- Number: US 2018/0024887 A1
- Document ID: US20180024887A1
- Status: Published application
- Kind: A1
- Application number: 15/705,782
- Filed: 2017-09-15
- Published: 2018-01-25
- Earliest claimed: 2014-01-31
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Thomas Franklin Shirley, Jr.; Gary W. Grube; Bart Cilfone; Ravi Khadiwala; Greg Dhuse; Thomas Darrel Cocagne; Michael Colin Storm; Yogesh Ramesh Vedpathak; Wesley Leggette; Jason K. Resch; Andrew Baptist; Ilya Volvovski
- Web page: https://patentgrep.com/patent/US20180024887A1

## CPC

- G06F 11/1092: {Rebuilding, e.g. when physically replacing a failing disk}
- G06F 3/06: Digital input from, or digital output to, record carriers {, e.g. RAID, emulated record carriers or networked record carriers}
- G06F 3/061: {Improving I/O performance}
- G06F 3/0619: {in relation to data integrity, e.g. data losses, bit errors}
- G06F 3/0635: {by changing the path, e.g. traffic rerouting, path reconfiguration}
- G06F 3/064: {Management of blocks}
- G06F 3/0659: {Command handling arrangements, e.g. command buffers, queues, command scheduling}
- G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]}
- G06F 21/6218: {to a system of files or objects, e.g. local or distributed file system or database}
- H04L 67/1097: for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
- G06F 2211/1028: Distributed, i.e. distributed RAID systems with parity
- H04L 63/20: {for managing network security; network security policies in general (filtering policies H04L63/0227)}
- 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 computing device of a dispersed storage network (DSN) includes a memory, interface and a processing module operable to identify an encoded data slice of the set of encoded data slices to produce an identified encoded data slice. The processing module generates a set of first write requests regarding the set of encoded data slices less the identified encoded data slice, and generates a set of second write requests regarding the identified encoded data slice. The set of second write requests include the identified encoded data slice and replications of the identified encoded data slice. The processing module sends the set of first write requests to storage units of the DSN, and sends the set of second write requests to a set of storage units of the DSN, where each storage unit of the set of storage units is sent a corresponding one of the set of second write requests.

## Claims

### Claim 1

A computing device of a dispersed storage network (DSN), the computing device comprises:
an interface;
memory; and
a processing module operably coupled to the memory and the interface, wherein the processing module is operable to write a set of encoded data slices to DSN memory by:
identifying an encoded data slice of the set of encoded data slices for a redundant write operation to produce an identified encoded data slice;
generating a set of first write requests regarding the set of encoded data slices less the identified encoded data slice;
generating a set of second write requests regarding the identified encoded data slice, the set of second write requests including the identified encoded data slice and replications of the identified encoded data slice;
sending the set of first write requests to storage units of the DSN memory; and
sending the set of second write requests to a set of storage units of the DSN memory,
wherein each storage unit of the set of storage units is sent a corresponding one of the set of second write requests.

### Claim 2 (depends on 1)

The computing device of claim 1, wherein the processing module is further operable to:
receive a write response from a storage unit of the set of storage units; and
send a delete write request to remaining storage units of the set of storage units.

### Claim 3 (depends on 1)

The computing device of claim 1, wherein the processing module is further operable to:
receive write responses from at least some storage units of a combined set of storage units that includes the storage units and the set of storage units; and
when a threshold number of write responses have been received, send a write commit command to each storage unit of the at least some storage units of the combined set of storage units.

### Claim 4 (depends on 3)

The computing device of claim 3, wherein the processing module is further operable to:
determine whether the at least some storage units of the combined set of storage units include a storage unit of the set of storage units; and
when the at least some storage units of the combined set of storage units includes the storage unit of the set of storage units:
send the write commit command to the storage unit of the set of storage units; and
send a rollback command to each remaining storage unit of the set of storage units.

### Claim 5 (depends on 3)

The computing device of claim 3, wherein the processing module is further operable to:
determine whether the at least some storage units of the combined set of storage units include a storage unit of the set of storage units; and
when the at least some storage units of the combined set of storage units does not include the storage unit of the set of storage units, send a rollback command to each storage unit of the set of storage units.

### Claim 6 (depends on 3)

The computing device of claim 3, wherein the processing module is further operable to:
receive commit responses from the at least some storage units of the combined set of storage units that includes the storage units and the set of storage units; and
when a commit threshold number of the commit responses have been received, send a write finalize command to each storage unit of the at least some storage units of the combined set of storage units.

### Claim 7 (depends on 6)

The computing device of claim 6, wherein the processing module is further operable to:
determine whether the at least some storage units of the combined set of storage units that provided the commit responses include a storage unit of the set of storage units; and
when the at least some storage units of the combined set of storage units that provided the commit responses includes the storage unit of the set of storage units:
send a write finalize command to the storage unit of the set of storage units; and
sending an undo command to each remaining storage unit of the set of storage units.

### Claim 8 (depends on 6)

The computing device of claim 6, wherein the processing module is further operable to:
determine whether the at least some storage units of the combined set of storage units that provided the commit responses include a storage unit of the set of storage units; and
when the at least some storage units of the combined set of storage units that provided the commit responses does not include the storage unit of the set of storage units, send an undo command to the set of storage units.

### Claim 9 (depends on 1)

The computing device of claim 1, wherein the processing module is further operable to:
identify a second encoded data slice of the set of encoded data slices for the redundant write operation to produce a second identified encoded data slice;
generate the set of first write requests regarding the set of encoded data slices less the identified encoded data slice and the second identified encoded data slice;
generate a set of third write requests regarding the second identified encoded data slice, the set of third write requests including the second identified encoded data slice and replications of the second identified encoded data slice; and
send the set of third write requests to a second set of storage units of the DSN memory, wherein each storage unit of the second set of storage units is sent a corresponding one of the set of third write requests.
