# US 2017/0289290 A1 · Selective token clash checking for a data write

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

- Number: US 2017/0289290 A1
- Document ID: US20170289290A1
- Status: Published application
- Kind: A1
- Application number: 15/086,745
- Filed: 2016-03-31
- Published: 2017-10-05
- Earliest claimed: 2016-03-31
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Shrirang S. Bhagwat; Pankaj Deshpande; Subhojit Roy; Rajat Toshniwal
- Web page: https://patentgrep.com/patent/US20170289290A1

## CPC

- H04L 67/562: Brokering proxy services
- G06F 3/061: {Improving I/O performance}
- G06F 3/0613: {in relation to throughput}
- G06F 3/065: {Replication mechanisms}
- 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 16/182: Distributed file systems
- H04L 47/527: {Quantum based scheduling, e.g. credit or deficit based scheduling or token bank}
- H04L 67/1095: Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
- 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 3/0635: {by changing the path, e.g. traffic rerouting, path reconfiguration}
- G06F 3/0647: {Migration mechanisms}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A first request may be received to write a first set of data to a first storage device of a first storage node. The first storage device may be capable of transferring or receiving data directly to or from a second storage device without transferring the data to or from a host device mapped to the first storage node. It may be determined that a first token clash check does not need to occur for the first request. The first token clash check may include determining whether the first request is requesting to write to one or more addresses that are associated with one or more tokens owned by one or more transactions. The one or more tokens may be a proxy for a set of data within one or more particular address ranges of the first storage device.

## Claims

### Claim 1

A computer-implemented method for selectively performing a token clash check for a data write, the method comprising:
receiving, by a first storage node, a first request to write a first set of data to a first storage device of the first storage node, wherein the first storage device is capable of transferring or receiving data directly to or from a second storage device without transferring the data to or from a host device mapped to the first storage node; and
determining, by the first storage node, that a first token clash check does not need to occur for the first request, the first token clash check including determining whether the first request is requesting to write to one or more addresses that are associated with one or more tokens owned by one or more transactions, the one or more tokens being a proxy for a set of data within one or more particular address ranges of the first storage device.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
receiving, by the first storage node, a second request to transfer a second set of data to the to the first storage device, the second request corresponding to transferring the second set of data from the second storage device directly to the first storage device without transferring the second set of data to or from any one or more host devices that are mapped to the first storage node; and
identifying, upon the receiving of the second request, each token of a plurality of tokens that are associated with the second request.

### Claim 3 (depends on 2)

The method of claim 2, further comprising:
determining that the first set of data of the first request corresponds to a same address space as at least a first token of the plurality of tokens of the second request; and
in response to the determining that the first set of data corresponds to the same address space, invalidating each of the plurality of tokens of the second request, wherein the second request is terminated.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
receiving, by the first storage node, a second request to transfer a second set of data to the to the first storage device, the second request corresponding to transferring the second set of data from the second storage device directly to the first storage device without transferring the second set of data to or from any one or more host devices that are mapped to the first storage node; and
invalidating, in response to the receiving of the second request and the determining that a first token clash check does not need to occur for the first request, each token owned by any transaction of the first storage device, wherein the second request is terminated.

### Claim 5 (depends on 1)

The method of claim 1, wherein the determining that a first token clash check does not need to occur is based on receiving information from an application associated with the first request, and wherein the application communicates to the first storage node indicating that the first token clash check does not need to occur.

### Claim 6 (depends on 1)

The method of claim 1, wherein the determining that a first token clash check does not need to occur is based on receiving a command from an administrator to set a flag, the set of the flag indicating that the first token clash check does not need to occur.

### Claim 7 (depends on 1)

The method of claim 1, wherein the determining that a first token clash check does not need to occur is based on determining that the first storage node is associated with a consistency group, the consistency group including a plurality of storage devices, wherein each of the plurality of storage devices include a same set of data.

### Claim 8 (depends on 1)

The method of claim 1, further comprising:
receiving, by the first storage node, a second request to write a second set of data to the first storage device of the first storage node;
determining, by the first storage node, that a second token clash check needs to occur for the second request based on information received from an application associated with the second request; and
performing, by the first storage node, the second token clash check by determining whether the second request is requesting to write to an address that is associated with a token owned by a transaction.

### Claim 9

A system comprising:
a first storage node having a processor; and
a computer readable storage medium having program instructions embodied therewith, the program instructions readable/executable by the processor to cause the system to perform a method, the method comprising:
receiving a first request to write a first set of data to a first storage device of the first storage node, wherein the first storage device is capable of transferring or receiving data directly to or from a second storage device without transferring the data to or from a host device mapped to the first storage node; and
determining that a first token clash check does not need to occur for the first request, the first token clash check including determining whether the first request is requesting to write to one or more addresses that are associated with one or more tokens owned by one or more transactions, the one or more tokens being a proxy for a set of data within one or more particular address ranges of the first storage device.

### Claim 10 (depends on 9)

The system of claim 9, wherein the method further comprises:
receiving a second request to transfer a second set of data to the first storage device, the second request corresponding to transferring the second set of data from the second storage device directly to the first storage device without transferring the second set of data to or from any one or more host devices that are mapped to the first storage node; and
identifying, upon the receiving of the second request, each token of a plurality of tokens that are associated with the second request.

### Claim 11 (depends on 10)

The system of claim 10, wherein the method further comprises:
determining that the first set of data of the first request corresponds to a same address space as at least a first token of the plurality of tokens of the second request; and
in response to the determining that the first set of data corresponds to the same address space, invalidating each of the plurality of tokens of the second request, wherein the second request is terminated.

### Claim 12 (depends on 9)

The system of claim 9, wherein the method further comprises:
receiving a second request to transfer a second set of data to the first storage device, the second request corresponding to transferring the second set of data from the second storage device directly to the first storage device without transferring the second set of data to or from any one or more host devices that are mapped to the first storage node; and
invalidating, in response to the receiving of the second request and the determining that a first token clash check does not need to occur for the first request, each token owned by any transaction of the first storage device, wherein the second request is terminated.

### Claim 13 (depends on 9)

The system of claim 9, wherein the determining that a first token clash check does not need to occur is based on receiving information from an application associated with the first request, and wherein the application communicates to the first storage node indicating that the first token clash check does not need to occur.

### Claim 14 (depends on 9)

The system of claim 9, wherein the method further comprises:
receiving a second request to write a second set of data to the first storage device of the first storage node;
determining that a second token clash check needs to occur for the second request based on information received from an application associated with the second request; and
performing the second token clash check by determining whether the second request is requesting to write to an address that is associated with a token owned by a transaction.

### Claim 15

A computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable/readable by a first storage node to:
receive a first set of data indicating whether a write is expected to be received at the first storage node while a first transaction is in progress, the first transaction requesting to transfer data directly to a first storage device of the first storage node from a second storage device without transferring the data to or from a host device mapped to the first storage node;
receive a second set of data indicating whether a first token clash check needs to occur, the first token clash check including determining whether a request is requesting to write to one or more addresses that are associated with one or more tokens owned by the first transaction, the one or more tokens being a proxy for a set of data within one or more particular address ranges of the first storage device.

### Claim 16 (depends on 15)

The computer program product of claim 15, wherein the program code is further executable/readable by the first storage node to:
determine, based on receiving the first set of data that the write is expected to be received at the first storage node;
receive, from a second transaction, a request to write a third set of data to the first storage device of the first storage node; and
determine, based on receiving the second set of data, that the first token clash check needs to occur for the second transaction.

### Claim 17 (depends on 15)

The computer program product of claim 15, wherein the program code is further executable/readable by the first storage node to:
determine, based on receiving the first set of data that the write is not expected to be received at the first storage node;
receive, from a second transaction, a request to write a third set of data to the first storage device of the first storage node;
determine, based on receiving the second set of data, that the first token clash check does not need to occur for the second transaction; and
invalidate each token associated with the first storage device and the first transaction.

### Claim 18 (depends on 15)

The computer program product of claim 15, wherein the program code is further executable/readable by the first storage node to:
identify, upon the requesting to transfer of the first transaction, each token of a plurality of tokens that are associated with the first transaction;
determine, based on receiving the first set of data that the write is not expected to be received at the first storage node;
receive, from a second transaction, a request to write a third set of data to the first storage device of the first storage node;
determine, based on receiving the second set of data, that the first token clash check does not need to occur for the second transaction; and
invalidate each token only associated with the first transaction and selectively choosing not to invalidate any other token associated with the first storage device.

### Claim 19 (depends on 15)

The computer program product of claim 15, wherein the receiving of the first set of data and the second set of data is based on receiving information from an application associated with the first transaction.

### Claim 20 (depends on 15)

The computer program product of claim 15, wherein the receiving of the first or second set of data is based on determining that the first storage node is associated with a consistency group, the consistency group including a plurality of storage devices, wherein each of the plurality of storage devices include a same set of data.
