Patents by Inventor Rod Gamache
Rod Gamache has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20060090095Abstract: A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.Type: ApplicationFiled: September 12, 2005Publication date: April 27, 2006Applicant: Microsoft CorporationInventors: Michael Massa, David Dion, Rajsekhar Das, Rushabh Doshi, David Lomet, Gor Nishanov, Philip Bernstein, Rod Gamache, Rohit Jain, Sunita Shrivastava
-
Publication number: 20060036896Abstract: A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members, independent from the nodes, maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.Type: ApplicationFiled: August 12, 2005Publication date: February 16, 2006Applicant: Microsoft CorporationInventors: Rod Gamache, Michael Massa, Sunita Shrivastava, Gor Nishanov, David Lomet, Philip Bernstein, Rohit Jain
-
Patent number: 6938084Abstract: A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members, independent from the nodes, maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.Type: GrantFiled: July 2, 2001Date of Patent: August 30, 2005Assignee: Microsoft CorporationInventors: Rod Gamache, Michael T. Massa, Sunita Shrivastava, Gor V. Nishanov, David B. Lomet, Philip A. Bernstein, Rohit Jain
-
Patent number: 6662219Abstract: A method and system wherein following a partitioning of a server cluster, operational subgroups arbitrate for possession of a quorum resource that determines cluster representation, wherein the arbitration is biased by a relative weight of the subgroup. The weight may be relative to the original cluster weight, or submitted as a bid that is relative to other possible subgroup weights. The biasing gives subgroups that are better capable of representing the cluster an arbitration advantage over lesser subgroups. The biasing weight of each subgroup may be determined by node count and/or by a calculation of the subgroup's resources. The arbitration may be delayed based on the relative weight, or alternatively, the arbitration may comprise a bidding process in which a subgroup's bid is based on the subgroup's relative weight.Type: GrantFiled: December 15, 1999Date of Patent: December 9, 2003Assignee: Microsoft CorporationInventors: Gor Nishanov, Glenn R. Peterson, Rod Gamache, Michael T. Massa, Sunita Shrivastava
-
Patent number: 6549934Abstract: A method and system for providing remote access and control of devices such as disks, tape drives and modems across a network. A client driver intercepts I/O requests that are destined for a device which an application essentially considers a local device, such as for purposes of disk mirroring. The client driver queues and dequeues the I/O request, marshals it with header information and data, and sends it as a message to the server over one of possibly multiple connections to the server. A server driver unmarshalls the message, places it in a preallocated buffer as designated by the client, and generates an I/O request therefrom directed to the server device. The server responds with a completion status. The client side manages the server buffers, and the client classifies and partitions large requests into one or more segments that fit the server buffers. Sequential processing also may be ensured.Type: GrantFiled: March 1, 1999Date of Patent: April 15, 2003Assignee: Microsoft CorporationInventors: Glenn R. Peterson, Rod Gamache, Michael T. Massa, Norbert P. Kusters
-
Publication number: 20020161889Abstract: A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members, independent from the nodes, maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.Type: ApplicationFiled: July 2, 2001Publication date: October 31, 2002Inventors: Rod Gamache, Michael T. Massa, Sunita Shrivastava, Gor V. Nishanov, David B. Lomet, Philip A. Bernstein, Rohit Jain
-
Patent number: 6453426Abstract: A method and system for distributing various types of cluster data among various storage devices of a server cluster. Cluster core boot data that is needed to get the cluster up and running is stored on a quorum storage mechanism, separate from cluster configuration data which is stored on lower cost and/or higher performance storage. The quorum storage may be implemented via a quorum of nodes, a single quorum disk or a quorum of replica members. The state of the cluster configuration data, as well as the state of other cluster data, may be stored on the quorum storage, thereby assuring the integrity of the data while providing increased reliability through the use of mirror sets of storage elements or the like for storing that data. Significant flexibility in how a cluster may be configured is achieved, along with improved cluster performance and scalability.Type: GrantFiled: March 26, 1999Date of Patent: September 17, 2002Assignee: Microsoft CorporationInventors: Rod Gamache, Michael T. Massa, Patrick J. Helland
-
Patent number: 6401120Abstract: A method and system for increasing the availability of a server cluster while reducing its cost by requiring at a minimum only one node and a quorum replica set of storage devices (replica members) to form and continue operating as a cluster. A plurality of replica members maintain the cluster operational data and are independent from any given node. A cluster may be formed and continue to operate as long as one server node possesses a quorum (majority) of the replica members. This ensures that a new or surviving cluster has a least one replica member that belonged to the immediately prior cluster and is thus correct with respect to the cluster operational data. Update sequence numbers and/or timestamps are used to determine the most updated replica member from among those in the quorum for reconciling the other replica members.Type: GrantFiled: March 26, 1999Date of Patent: June 4, 2002Assignee: Microsoft CorporationInventors: Rod Gamache, Michael T. Massa
-
Patent number: 6279032Abstract: A method and system for selecting a set of systems (nodes) for a server cluster from at least two non-communicating sets of systems. A persistent storage device with cluster configuration information therein is provided as a quorum resource. Using an arbitration process, only one system exclusively reserves the quorum resource. The set with the system therein having the exclusive reservation of the quorum device is selected as the cluster. The arbitration process provides a challenge-defense protocol whereby a system can obtain the reservation of the quorum device when the system that has the reservation fails.Type: GrantFiled: November 3, 1997Date of Patent: August 21, 2001Assignee: Microsoft CorporationInventors: Robert T. Short, Rod Gamache, Michael T. Massa, John D. Vert
-
Patent number: 6243825Abstract: A method and system for transparently failing over a computer name with a legacy application running in a server cluster. When the application is set for failing over in the cluster, the cluster software locates a virtual computer name on which the application is dependent, and associates the virtual name with the application. When the application runs and requests its computer name from the system, the system looks for the virtual computer name, and, if detected, the system returns the virtual computer name to the application as the computer name. The virtual computer name thus moves with the application regardless of the machine on which it is running in the cluster. When the application is not set for failing over in the cluster, the system instead returns the actual machine name.Type: GrantFiled: April 17, 1998Date of Patent: June 5, 2001Assignee: Microsoft CorporationInventors: Rod Gamache, Mark Lucovsky, John D. Vert
-
Patent number: 6178529Abstract: A method and system in a server cluster for monitoring and controlling a resource object, such as a physical device or application. A cluster service connects to a resource monitoring component to control and monitor the health of one or more resource objects. The resource component includes a plurality of methods, common to all such resource components, for calling by the resource monitor to control and monitor operation of the resource object therethrough. The common methods enable the cluster server to treat all resources similarly without regard to the type of resource.Type: GrantFiled: November 3, 1997Date of Patent: January 23, 2001Assignee: Microsoft CorporationInventors: Robert T. Short, Rod Gamache, Michael T. Massa, John D. Vert
-
Patent number: 6163855Abstract: A method and system for communicating modification information to servers in a server cluster. Local changes, such as modifications to a resource requested at one node, are associated into a single transaction. A master node, such as the node that owns the set of resources corresponding to the modifications in the transaction requests permission from a locker node to replicate the transaction. When permission to replicate the transaction is received from the locker node, the master node replicates the transaction by requesting each node in the cluster, one node at a time, to commit the transaction. Any node that does not commit the transaction is removed from the cluster, ensuring consistency of the cluster. Failure conditions of any node or nodes are also handled in a manner that ensures consistency.Type: GrantFiled: April 17, 1998Date of Patent: December 19, 2000Assignee: Microsoft CorporationInventors: Sunita Shrivastava, Rod Gamache, John D. Vert
-
Patent number: 6081846Abstract: A method and computer program product that overcomes the problem of intrasystem copying of data from one data structure to another while processing incoming packets of network data coming into the system off a communications network in an environment having an integrating component in between the network card device driver and the transport protocol driver that assigns system memory for packets to the respective drivers. The integrating component temporarily transfers ownership of the original data structure from the network card device driver to the transport protocol driver based on indication from the network card device driver, independent determination that the network card device driver can afford to temporarily release ownership, and determination of the transport protocol driver's ability to take ownership. The transport protocol driver will indicate receipt of ownership of the data structure and later explicitly release it.Type: GrantFiled: May 8, 1997Date of Patent: June 27, 2000Assignee: Microsoft CorporationInventors: Jameel Hyder, Kyle Brandon, Nk Srinivas, Rod Gamache