Patents Assigned to Wandisco, Inc.
-
Patent number: 9495381Abstract: 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.Type: GrantFiled: March 31, 2014Date of Patent: November 15, 2016Assignee: WANdisco, Inc.Inventors: Konstantin V Shvachko, Yeturu Aahlad, Jagane Sundar, Plamen Jeliazkov Jeliazkov
-
Patent number: 9467510Abstract: 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.Type: GrantFiled: January 22, 2016Date of Patent: October 11, 2016Assignee: WANdisco, Inc.Inventors: Yeturu Aahlad, Michael Parkin, Naeem Akhtar
-
Patent number: 9424272Abstract: 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.Type: GrantFiled: September 30, 2013Date of Patent: August 23, 2016Assignee: WANdisco, Inc.Inventors: Konstantin V Shvachko, Jagane Sundar, Michael Parkin, Yeturu Aahlad
-
Patent number: 9361311Abstract: 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.Type: GrantFiled: August 29, 2013Date of Patent: June 7, 2016Assignee: WANdisco, Inc.Inventors: Kostantin V Shvachko, Jagane Sundar, Micahel Parkin, Yeturu Aahlad
-
Patent number: 9332069Abstract: A computer-implemented method of deploying a membership of nodes in a distributed computing system may comprise selecting nodes to be part of a membership of nodes; creating a membership task identifying a membership creator node as the node that is creating the membership and comprising a membership target identifying at least one node of the distributed computing system that is to become a member of the membership; and creating a beacon configured to send a create membership message to each identified node, the create membership message comprising at least an identity of the membership task and an identification of the membership. Upon receiving a response from a node in the membership target, the node from which the response was received may be removed from the beacon. The membership may be deployed when a response has been received from each of the nodes identified in the membership target.Type: GrantFiled: March 15, 2013Date of Patent: May 3, 2016Assignee: WANdisco, Inc.Inventors: Yeturu Aahlad, Michael Parkin, Naeem Akhtar
-
Patent number: 9264516Abstract: 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.Type: GrantFiled: March 15, 2013Date of Patent: February 16, 2016Assignee: WANdisco, INC.Inventors: Yeturu Aahlad, Michael Parkin, Naeem Akhtar
-
Patent number: 9154553Abstract: 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.Type: GrantFiled: August 20, 2014Date of Patent: October 6, 2015Assignee: WANdisco, INC.Inventors: Yeturu Aahlad, Michael Parkin, Naeem Akhtar
-
Publication number: 20150278244Abstract: 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.Type: ApplicationFiled: March 31, 2014Publication date: October 1, 2015Applicant: WANdisco, Inc.Inventors: Konstantin V. SHVACHKO, Yeturu AAHLAD, Jagane SUNDAR, Plamen Jeliazkov JELlAZKOV
-
Patent number: 9009215Abstract: 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.Type: GrantFiled: March 15, 2013Date of Patent: April 14, 2015Assignee: WANdisco, Inc.Inventors: Yeturu Aahlad, Michael Parkin, Naeem Akhtar
-
Publication number: 20150067004Abstract: 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.Type: ApplicationFiled: September 30, 2013Publication date: March 5, 2015Applicant: WANdisco, Inc.Inventors: Konstantin V. SHVACHKO, Jagane Sundar, Micahel Parkin, Yeturu Aahlad
-
Publication number: 20150067002Abstract: 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.Type: ApplicationFiled: August 29, 2013Publication date: March 5, 2015Applicant: WANdisco, Inc.Inventors: Konstantin V. Shvachko, Jagane Sundar, Micahel Parkin, Yeturu Aahlad
-
Publication number: 20140280452Abstract: 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.Type: ApplicationFiled: March 15, 2013Publication date: September 18, 2014Applicant: WANdisco, Inc.Inventor: WANdisco, Inc.
-
Publication number: 20140188971Abstract: 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.Type: ApplicationFiled: March 15, 2013Publication date: July 3, 2014Applicant: WANdisco, Inc.Inventor: WANdisco, Inc.
-
Publication number: 20140189004Abstract: A computer-implemented method of deploying a membership of nodes in a distributed computing system may comprise selecting nodes to be part of a membership of nodes; creating a membership task identifying a membership creator node as the node that is creating the membership and comprising a membership target identifying at least one node of the distributed computing system that is to become a member of the membership; and creating a beacon configured to send a create membership message to each identified node, the create membership message comprising at least an identity of the membership task and an identification of the membership. Upon receiving a response from a node in the membership target, the node from which the response was received may be removed from the beacon. The membership may be deployed when a response has been received from each of the nodes identified in the membership target.Type: ApplicationFiled: March 15, 2013Publication date: July 3, 2014Applicant: WANdisco, Inc.Inventor: WANdisco, Inc.
-
Patent number: 8364633Abstract: In one embodiment of the present invention, a replicated state machine comprises a proposal manager, an agreement manager, a collision/back-off timer and a storage reclaimer. The proposal manager facilitates management of proposals issued by a node of a distributed application for enabling coordinated execution of the proposals by all other nodes of the distributed application. The agreement manager facilitates agreement on the proposals. The collision/back-off timer precludes repeated pre-emptions of rounds in attempting to achieve agreement on the proposals. The storage reclaimer reclaims persistent storage utilized for storing at least one of proposal agreements and the proposals.Type: GrantFiled: January 11, 2006Date of Patent: January 29, 2013Assignee: Wandisco, Inc.Inventors: Yeturu Aahlad, Rahul Bhargava, James Milton Campigli, David James Richards, Mohammad Naeem Akhtar