# US 2021/0342312 A1 · Concurrent access and transactions in a distributed file system

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

- Number: US 2021/0342312 A1
- Document ID: US20210342312A1
- Status: Published application
- Kind: A1
- Application number: 17/240,729
- Filed: 2021-04-26
- Published: 2021-11-04
- Earliest claimed: 2014-10-27
- Assignees: Cohesity, Inc.
- Applicants: Cohesity, Inc.
- Inventors: Mohit Aron; Ganesha Shanmuganathan
- Web page: https://patentgrep.com/patent/US20210342312A1

## CPC

- G06F 16/1865: {Transactional file systems}
- G06F 16/10: File systems; File servers
- G06F 16/1767: {Concurrency control, e.g. optimistic or pessimistic approaches}
- G06F 16/182: Distributed file systems
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

According to one embodiment of the present disclosure, a first set of file system objects included in performing a requested file system operation is identified in response to a request to perform a file system operation. An update intent corresponding to the requested file system operation is inserted into a data structure associated with each identified file system object. Each file system object corresponding to the corresponding data structure is modified as specified by the update intent in that data structure. After modifying the file system object corresponding to the corresponding data structure, the update intent is removed from that data structure.

## Claims

### Claim 1

(canceled)

### Claim 2

A method, comprising:
identifying a plurality of file system data structures to modify to perform a file system operation;
obtaining, by a computing node of a distributed file system, a corresponding node-level lock for each of the plurality of file system data structures;
obtaining, by the computing node of the distributed file system, a corresponding process-wide lock for each of the plurality of file system data structures; and
performing the file system operation.

### Claim 3 (depends on 2)

The method of claim 2, wherein the plurality of file system data structures are a plurality of inodes.

### Claim 4 (depends on 2)

The method of claim 2, further comprising receiving a request to perform the file system operation.

### Claim 5 (depends on 4)

The method of claim 4, wherein the request specifies a source directory, a destination directory, and a file handle.

### Claim 6 (depends on 2)

The method of claim 2, wherein obtaining the corresponding node-level lock for each of the plurality of file system data structures includes requesting, from a distributed lock service, the corresponding node-level lock for each of the plurality of file system data structures.

### Claim 7 (depends on 6)

The method of claim 6, wherein obtaining the corresponding node-level lock for each of the plurality of file system data structures further includes receiving from the distributed lock service, the corresponding node-level lock for each of the plurality of file system data structures.

### Claim 8 (depends on 6)

The method of claim 6, wherein obtaining the corresponding node-level lock for each of the plurality of file system data structures further includes waiting for the corresponding node-level lock for each of the plurality of file system data structures in the event at least one of the corresponding node-level lock for each of the plurality of file system data structures is being used by another computing node of the distributed file system.

### Claim 9 (depends on 2)

The method of claim 2, wherein obtaining the corresponding process-wide lock for each of the plurality of file system data structures includes requesting from a process-wide lock service the corresponding process-wide lock for each of the plurality of file system data structures.

### Claim 10 (depends on 2)

The method of claim 2, wherein performing the file system operation includes generating a corresponding update intent for each of the plurality of file system data structures.

### Claim 11 (depends on 10)

The method of claim 10, wherein performing the file system operation further includes storing the corresponding generated update intent into each of the plurality of file system data structures.

### Claim 12 (depends on 11)

The method of claim 11, wherein the corresponding generated update intent are stored into each of the plurality of file system data structures in a particular order.

### Claim 13 (depends on 11)

The method of claim 11, wherein performing the file system operation further includes modifying each of the plurality of file system data structures based on the corresponding generated update intent.

### Claim 14 (depends on 13)

The method of claim 13, wherein performing the file system operation further includes removing the corresponding generated update intent after modifying a file system data structure.

### Claim 15

A computer program product embodied in a non-transitory computer readable medium and comprising computer instructions for:
identifying a plurality of file system data structures to modify to perform a file system operation;
obtaining, by a computing node of a distributed file system, a corresponding node-level lock for each of the plurality of file system data structures;
obtaining, by the computing node of the distributed file system, a corresponding process-wide lock for each of the plurality of file system data structures; and
performing the file system operation.

### Claim 16 (depends on 15)

The computer program product of claim 15, wherein the plurality of file system data structures are a plurality of inodes.

### Claim 17 (depends on 15)

The computer program product of claim 15, further comprising computer instructions for receiving a request to perform the file system operation.

### Claim 18 (depends on 15)

The computer program product of claim 15, wherein obtaining the corresponding node-level lock for each of the plurality of file system data structures includes requesting, from a distributed lock service, the corresponding node-level lock for each of the plurality of file system data structures.

### Claim 19 (depends on 18)

The computer program product of claim 18, wherein obtaining the corresponding node-level lock for each of the plurality of file system data structures further includes receiving from the distributed lock service, the corresponding node-level lock for each of the plurality of file system data structures.

### Claim 20 (depends on 15)

The computer program product of claim 15, wherein obtaining the corresponding node-level lock for each of the plurality of file system data structures further includes waiting for the corresponding node-level lock for each of the plurality of file system data structures in the event at least one of the corresponding node-level lock for each of the plurality of file system data structures is being used by another computing node of the distributed file system.

### Claim 21

A computing node, comprising:
a processor configured to:
identify a plurality of file system data structures to modify to perform a file system operation;
obtain a corresponding node-level lock for each of the plurality of file system data structures;
obtain a corresponding process-wide lock for each of the plurality of file system data structures;
perform the file system operation; and
a memory coupled to the processor and configured to provide the processor with instructions.
