Abstract:
A caching method for a distributed storage system, a lock server node, and a lock client node is disclosed. When the lock server node receives a first lock request sent by the first lock client node for locking a first data stripe, if the lock server node determines that the first lock request is a read lock request received for the first time on the first data stripe or a write lock request on the first data stripe, the lock server node records the owner of the first data stripe is the first lock client node in recorded attribute information of data stripes, and returns to the first lock client node a first response message indicating that the owner of the first data stripe is the first lock client node, and instructing the first lock client node to cache the first data stripe.
Abstract:
In a method, identifiers are obtained of N to-be-upgraded nodes. An upgrade sequence of the N to-be-upgraded nodes is set according to the identifiers of the N to-be-upgraded nodes. A backup node of each to-be-upgraded node is determined according to the upgrade sequence of the N to-be-upgraded nodes, to obtain node backup information. A backup node of the Xth to-be-upgraded node is at least one node in a set that includes a to-be-upgraded node prior to the Xth to-be-upgraded node and a to-be-upgraded node following the (X+[Z+1])th to-be-upgraded node. Z is a ratio of a time required by the Xth to-be-upgraded node for migrating back service data to an online upgrade time of the Xth to-be-upgraded node. The node backup information is sent to the N to-be-upgraded nodes.
Abstract:
A data processing method and a device in a distributed file storage system, where the method includes receiving, by a client agent, a data processing request which carries a file identifier, an offset address, a file length, and other information of a target file; obtaining, by the client agent, redundancy information according to the file identifier carried in the data processing request, where the redundancy information includes a quantity of data strips, N, of the distributed file storage system and a quantity of parity strips, M, of the distributed file storage system; determining a quantity of valid strips, DSC, of the target file according to the offset address and the length information; determining a quantity of actual strips, N′, of the target file according to the DSC and the M; and determining corresponding strips according to the N′ and processing the corresponding strips.
Abstract:
A data processing method and a device in a distributed file storage system, where the method includes receiving, by a client agent, a data processing request which carries a file identifier, an offset address, a file length, and other information of a target file; obtaining, by the client agent, redundancy information according to the file identifier carried in the data processing request, where the redundancy information includes a quantity of data strips, N, of the distributed file storage system and a quantity of parity strips, M, of the distributed file storage system; determining a quantity of valid strips, DSC, of the target file according to the offset address and the length information; determining a quantity of actual strips, N′, of the target file according to the DSC and the M; and determining corresponding strips according to the N′ and processing the corresponding strips.
Abstract:
A data access method in a file system comprises receiving a data access request including an identifier of a to-be-accessed node, obtaining access permission for the to-be-accessed node based on the identifier of the to-be-accessed node, wherein when a permission version number of the to-be-accessed node is not the latest in permission version numbers of all nodes indicated by path information of the to-be-accessed node in a file system, the access permission for the to-be-accessed node inherits a permission record corresponding to a parent node that is of the to-be-accessed node and that has a latest permission version number, and performing authentication based on the access permission for the to-be-accessed node, and accessing data of the to-be-accessed node after the authentication succeeds.
Abstract:
In a method, identifiers are obtained of N to-be-upgraded nodes. An upgrade sequence of the N to-be-upgraded nodes is set according to the identifiers of the N to-be-upgraded nodes. A backup node of each to-be-upgraded node is determined according to the upgrade sequence of the N to-be-upgraded nodes, to obtain node backup information. A backup node of the Xth to-be-upgraded node is at least one node in a set that includes a to-be-upgraded node prior to the Xth to-be-upgraded node and a to-be-upgraded node following the (X+[Z+1])th to-be-upgraded node. Z is a ratio of a time required by the Xth to-be-upgraded node for migrating back service data to an online upgrade time of the Xth to-be-upgraded node. The node backup information is sent to the N to-be-upgraded nodes.
Abstract:
A caching method for a distributed storage system, a lock server node, and a lock client node is disclosed. When the lock server node receives a first lock request sent by the first lock client node for locking a first data stripe, if the lock server node determines that the first lock request is a read lock request received for the first time on the first data stripe or a write lock request on the first data stripe, the lock server node records the owner of the first data stripe is the first lock client node in recorded attribute information of data stripes, and returns to the first lock client node a first response message indicating that the owner of the first data stripe is the first lock client node, and instructing the first lock client node to cache the first data stripe.