Abstract:
A computer-implemented method of migrating metadata from a donor filesystem D having a rooted tree structure to a beneficiary filesystem B while processing commands that operate on the metadata may comprise, while a command to operate on the metadata is not received, replicating the donor filesystem D at the beneficiary filesystem B by sequentially copying metadata of nodes of the donor filesystem D to the beneficiary filesystem B. When a command is received to operate on the metadata, the command may be executed at both the donor filesystem D and the beneficiary filesystem B when all arguments of the command are present in both the donor filesystem D and the beneficiary filesystem B. When none of arguments are present in the beneficiary filesystem B, the command may be executed at the donor filesystem D only. When only some of the arguments are present in the beneficiary filesystem B, the command may be enqueued at least until all arguments of the command are present in the beneficiary filesystem B. When all arguments thereof are present in the beneficiary filesystem B, the enqueued commands may be dequeued and scheduled for execution.
Abstract:
A cluster of nodes implements a single distributed file system comprises at least first and second data centers and a coordination engine process. The first data center may comprise first DataNodes configured to store data blocks of client files, and first NameNodes configured to update a state of a namespace of the cluster. The second data center, geographically remote from and coupled to the first data center by a wide area network, may comprise second DataNodes configured to store data blocks of client files, and second NameNodes configured to update the state of the namespace. The first and second NameNodes are configured to update the state of the namespace responsive to data blocks being written to the DataNodes. The coordination engine process spans the first and second NameNodes and coordinates updates to the namespace stored such that the state thereof is maintained consistent across the first and second data centers.
Abstract:
A messaging model and node induction methods and corresponding devices and systems are disclosed herein that are effective to enable an inductor node to induct an inductee node into a distributed computing system and to enable the inducted node to carry out predetermined tasks.
Abstract:
A cluster of nodes in a distributed file system may include; at least two namenodes, each coupled to a plurality of data nodes and each configured to store a state of a namespace of the cluster and each being configured to respond to a request from a client while other(s) of the namenodes are responding to other requests from other clients; and a coordination engine coupled to each of the namenodes. The coordination engine may be configured to receive proposals from the namenodes to change the state of the namespace by replicating, deleting and/or adding data blocks stored in the data nodes and to generate, in response, an ordered set of agreements that specifies an order in which the namenodes are to change the state of the namespace. The namenodes are configured to delay making changes thereto until after the ordered set of agreements is received from the coordination engine.
Abstract:
A computer-implemented method of migrating metadata from a donor filesystem D having a rooted tree structure to a beneficiary filesystem B while processing commands that operate on the metadata may comprise, while a command to operate on the metadata is not received, replicating the donor filesystem D at the beneficiary filesystem B by sequentially copying metadata of nodes of the donor filesystem D to the beneficiary filesystem B. When a command is received to operate on the metadata, the command may be executed at both the donor filesystem D and the beneficiary filesystem B when all arguments of the command are present in both the donor filesystem D and the beneficiary filesystem B. When none of arguments are present in the beneficiary filesystem B, the command may be executed at the donor filesystem D only. When only some of the arguments are present in the beneficiary filesystem B, the command may be enqueued at least until all arguments of the command are present in the beneficiary filesystem B. When all arguments thereof are present in the beneficiary filesystem B, the enqueued commands may be dequeued and scheduled for execution.
Abstract:
A computer-implemented method may comprise providing a first executed agreement cache in a first data center and a second executed agreement cache in a second data center; receiving agreements on proposals to create or make changes to files stored in the first and second data centers; storing metadata of the files referred to by the received agreements the first and/or second executed agreement caches; maintaining the first and second executed agreement caches synchronous with one another before the files referred to by the received agreements are created or changed; creating or making changes to the file referred to by the received agreements only after the first and second executed agreement caches have been synchronized; and searching the first and/or second executed agreement caches for updated metadata whenever requests for data of files stored in the first or second data centers are received in the first or the second data centers and, responsive to the received requests, providing data corresponding to the updated metadata when updated metadata is found.
Abstract:
First and second pluralities of replicated state machines may execute a sequence of ordered agreements to make mutations to data stored in first and second data storage services of first and second types, respectively. First and second metadata of the mutated data stored in the first and second data storage services may then be received and stored. The first and second data storage services may then be synchronized using the received first and second metadata to determine when the data stored in the first and second data storage services have both settled after having mutated according to a predetermined agreement of the sequence of ordered agreements. A comparison of the stored first and second metadata may then be carried out when the data stored in the first data storage service and the data stored in the second data storage service have settled according to the predetermined agreement.
Abstract:
A cluster of nodes in a distributed file system may include; at least two namenodes, each coupled to a plurality of data nodes and each configured to store a state of a namespace of the cluster and each being configured to respond to a request from a client while other(s) of the namenodes are responding to other requests from other clients; and a coordination engine coupled to each of the namenodes. The coordination engine may be configured to receive proposals from the namenodes to change the state of the namespace by replicating, deleting and/or adding data blocks stored in the data nodes and to generate, in response, an ordered set of agreements that specifies an order in which the namenodes are to change the state of the namespace. The namenodes are configured to delay making changes thereto until after the ordered set of agreements is received from the coordination engine.
Abstract:
A computer-implemented method may comprise processing agreements received over a computer network at a first replicated state machine deployed on processes belonging to a first membership in an order defined by a first globally ordered set of agreements associated with the first membership; receiving an agreement to change membership that is configured to cause the first replicated state machine to be deployed on processes belonging to a second membership that is associated with a second globally ordered set of agreements; and processing the agreement to change membership at a point within the first globally ordered set of agreements.
Abstract:
A computer-implemented method may comprise receiving proposals to mutate a data stored in a distributed and replicated file system coupled to a network, the distributed and replicated data system comprising a plurality of nodes, each comprising a server. A metadata service maintains and updates a replica of a namespace of the distributed and replicated file system and coordinates updates to the data by generating an ordered set of agreements corresponding to the received proposals, the ordered set of agreements specifying an order in which the nodes are to mutate data stored in data nodes and cause corresponding changes to the state of the namespace. For each agreement in the generated ordered set of agreements, a corresponding writers list may be provided that comprises an ordered list of nodes to execute the agreement and make corresponding changes to the namespace. The ordered set of agreements may then be sent to the plurality of nodes along with, for each agreement in the ordered set of agreements, the corresponding writers list or a pre-generated index thereto and each of the plurality of nodes may be configured to only execute agreements for which it is a first-listed node on the received writers list.