Patents by Inventor Gopala Krishna R. Kakivaya
Gopala Krishna R. Kakivaya 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).
-
Patent number: 10901644Abstract: Data-aware orchestration with respect to a distributed system platform enables at least lifting and shifting of pre-existing applications and associated data without developer action. A volume of a local store is created automatically in response to a container comprising a user application that is non-native with respect to the distributed system platform. The volume is then exposed to the container for use by the application to save and retrieve data. The container and local store are co-located on a compute node providing at least high availability. The application and local store can be duplicated on one or more replicas providing reliability in case of a failure. Further, partitions can be created automatically in response to declarative specification.Type: GrantFiled: October 8, 2018Date of Patent: January 26, 2021Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Subramanian Ramaswamy, Raja Krishnaswamy, Kumar Gaurav Khanna, Gopala Krishna R. Kakivaya
-
Publication number: 20200042222Abstract: Data-aware orchestration with respect to a distributed system platform enables at least lifting and shifting of pre-existing applications and associated data without developer action. A volume of a local store is created automatically in response to a container comprising a user application that is non-native with respect to the distributed system platform. The volume is then exposed to the container for use by the application to save and retrieve data. The container and local store are co-located on a compute node providing at least high availability. The application and local store can be duplicated on one or more replicas providing reliability in case of a failure. Further, partitions can be created automatically in response to declarative specification.Type: ApplicationFiled: October 8, 2018Publication date: February 6, 2020Inventors: Subramanian Ramaswamy, Raja Krishnaswamy, Kumar Gaurav Khanna, Gopala Krishna R. Kakivaya
-
Patent number: 10078562Abstract: A state manager provides transactional distributed lifecycle management of a group of different application-level state providers, namely, differently structured application program data structures. The state providers are atomic with respect to one another. The state provider is replicated to one or more secondary nodes of a distributed network. The state providers are persistent despite one or more node operational failures. State provider lifecycle operations include creation of a transactional distributed state provider as a member of a group of different application-level state providers which include differently structured application program data structures, deletion of a previously created transactional distributed state provider, and/or enumeration of any previously created transactional distributed state providers. A given state provider may be read or written by one or more applications. Implementation restrictions and other avoidance conditions are satisfied in particular cases.Type: GrantFiled: August 18, 2015Date of Patent: September 18, 2018Assignee: Microsoft Technology Licensing, LLCInventors: Preetha Lakshmi Subbarayalu, Gopala Krishna R. Kakivaya, Mihail Gavril Tarta
-
Patent number: 9806951Abstract: Determining if a new federation should be formed. A method includes a voter node determining that it has sufficient votes to form a new federation. The method further includes determining that no node existing in a previous federation already has a quorum of valid global tickets. Each global ticket indicates that a node agrees that a federation should continue to exist. As a result, the voter node forms a new federation.Type: GrantFiled: January 18, 2013Date of Patent: October 31, 2017Assignee: Microsoft Technology Licensing, LLCInventors: Lu Xun, Alex Wun, Gopala Krishna R. Kakivaya, Rishi Rakesh Sinha
-
Patent number: 9727394Abstract: Techniques are described herein that are capable of establishing causality order of computer trace records. A computer trace record is information that indicates an event that occurs with regard to execution of a computer program. For instance, machines in a distributed computer system may generate such computer trace records as the machines execute the computer program. The computer trace records may be ordered in an aggregated trace to accurately reflect the causality order of the computer trace records. A causality order of computer trace records is a temporal sequence of the computer trace records in which each cause event is indicated to occur before each effect event that is caused by the cause event. A cause event is an event that causes an effect event. An effect event is an event that is caused by a cause event.Type: GrantFiled: April 27, 2015Date of Patent: August 8, 2017Assignee: Microsoft Technology Licensing, LLCInventors: Lu Xun, Gopala Krishna R. Kakivaya, Mihail Gavril Tarta
-
Publication number: 20170201447Abstract: Maintaining ring consistency when a node leaves a ring includes a first adjacent node to a leaving node receiving an indication, from the leaving node, indicating its intent to leave the ring. The first adjacent node sends a first indication to a second adjacent node indicating i) acceptance of the leaving node's intent to leave id-space ownership for a portion of the id-space between the leaving node and the first adjacent node, and ii) establishment of a one-way monitoring relationship between the first adjacent node and the second adjacent node. The first adjacent node receives a second indication, from the second adjacent node, indicating i) acceptance of the first adjacent node's intent to assume id-space ownership for the portion of the id-space between the leaving node and the first adjacent node, and ii) establishment of the one-way monitoring relationship between the second adjacent node and the first adjacent node.Type: ApplicationFiled: March 24, 2017Publication date: July 13, 2017Inventors: Richard L. Hasha, Lu Xun, Gopala Krishna R. Kakivaya, Dahlia Malkhi
-
Publication number: 20170139980Abstract: A multi-version removal manager for a transaction processing system is disclosed. A visibility sequence number is provided to versions such that operations with a lower sequence number than the visibility sequence number have been applied and a preselected amount of operations with a higher sequence number could have been applied. Visible version versions are maintained and versions related to a visibility sequence number are removed after an executing transaction is disposed.Type: ApplicationFiled: November 14, 2016Publication date: May 18, 2017Applicant: Microsoft Technology Licensing, LLCInventors: Mert Coskun, Gopala Krishna R. Kakivaya, Jesse M. Benson, Preetha L. Subbarayalu
-
Patent number: 9647917Abstract: The present invention extends to methods, systems, and computer program products for a joining node to join a ring of nodes within a rendezvous federation. Embodiments of the invention include establishing a neighborhood of multiple nodes on the ring of nodes. The joining node indicates its intent to take id-space ownership for a portion of the id-space between the joining node and a selected immediately adjacent node. The joining node initiates a one-way monitoring relationship with the selected immediately adjacent node. The joining node receiving an indication from the selected immediately adjacent node that indicates acceptance of the joining node's intent to take id-space ownership for a portion of the id-space between the joining node and the selected node and indicates establishment of a one-way monitoring relationship between the selected node and the joining node. The joining node agrees to participate in a one-way monitoring relationship with the selected node.Type: GrantFiled: April 8, 2015Date of Patent: May 9, 2017Assignee: Microsoft Technology Licensing, LLCInventors: Richard L. Hasha, Lu Xun, Gopala Krishna R. Kakivaya, Dahlia Malkhi
-
Publication number: 20170052856Abstract: A state manager provides transactional distributed lifecycle management of a group of different application-level state providers, namely, differently structured application program data structures. The state providers are atomic with respect to one another. The state provider is replicated to one or more secondary nodes of a distributed network. The state providers are persistent despite one or more node operational failures. State provider lifecycle operations include creation of a transactional distributed state provider as a member of a group of different application-level state providers which include differently structured application program data structures, deletion of a previously created transactional distributed state provider, and/or enumeration of any previously created transactional distributed state providers. A given state provider may be read or written by one or more applications. Implementation restrictions and other avoidance conditions are satisfied in particular cases.Type: ApplicationFiled: August 18, 2015Publication date: February 23, 2017Inventors: Preetha Lakshmi SUBBARAYALU, Gopala Krishna R. KAKIVAYA, Mihail Gavril TARTA
-
Publication number: 20160314026Abstract: Techniques are described herein that are capable of establishing causality order of computer trace records. A computer trace record is information that indicates an event that occurs with regard to execution of a computer program. For instance, machines in a distributed computer system may generate such computer trace records as the machines execute the computer program. The computer trace records may be ordered in an aggregated trace to accurately reflect the causality order of the computer trace records. A causality order of computer trace records is a temporal sequence of the computer trace records in which each cause event is indicated to occur before each effect event that is caused by the cause event. A cause event is an event that causes an effect event. An effect event is an event that is caused by a cause event.Type: ApplicationFiled: April 27, 2015Publication date: October 27, 2016Inventors: Lu Xun, Gopala Krishna R. Kakivaya, Mihail Gavril Tarta
-
Patent number: 9244926Abstract: Resources are organized into collections to facilitate more efficient and reliable resource access. Namespace managers communicate with one another to form a federation namespace infrastructure. The infrastructure can efficiently route, migrate, and process namespace requests, such as, for example, namespace registration requests from providers requesting to manage portions of namespaces and lookup requests from consumers requesting access to managed resources. Resources can be registered in and made accessible from multiple different namespaces. Resources can be identified using nested queries that filter results at multiple levels of a hierarchical namespace.Type: GrantFiled: August 30, 2012Date of Patent: January 26, 2016Assignee: Microsoft Technology Licensing, LLCInventors: Gopala Krishna R. Kakivaya, Richard L. Hasha
-
Publication number: 20150244602Abstract: The present invention extends to methods, systems, and computer program products for a joining node to join a ring of nodes within a rendezvous federation. Embodiments of the invention include establishing a neighborhood of multiple nodes on the ring of nodes. The joining node indicates its intent to take id-space ownership for a portion of the id-space between the joining node and a selected immediately adjacent node. The joining node initiates a one-way monitoring relationship with the selected immediately adjacent node. The joining node receiving an indication from the selected immediately adjacent node that indicates acceptance of the joining node's intent to take id-space ownership for a portion of the id-space between the joining node and the selected node and indicates establishment of a one-way monitoring relationship between the selected node and the joining node. The joining node agrees to participate in a one-way monitoring relationship with the selected node.Type: ApplicationFiled: April 8, 2015Publication date: August 27, 2015Inventors: Richard L. Hasha, Lu Xun, Gopala Krishna R. Kakivaya, Dahlia Malkhi
-
Patent number: 9106480Abstract: The present invention extends to methods, systems, and computer program products for performing computations in a distributed infrastructure. Embodiments of the invention include a general purpose distributed computation infrastructure that can be used to perform efficient (in-memory), scalable, failure-resilient, atomic, flow-controlled, long-running state-less and state-full distributed computations. Guarantees provided by a distributed computation infrastructure can build upon existent guarantees of an underlying distributed fabric in order to hide the complexities of fault-tolerance, enable large scale highly available processing, allow for efficient resource utilization, and facilitate generic development of stateful and stateless computations. A distributed computation infrastructure can also provide a substrate on which existent distributed computation models can be enhanced to become failure-resilient.Type: GrantFiled: June 24, 2013Date of Patent: August 11, 2015Assignee: Microsoft Technology Licensing, LLCInventors: Mihail Gavril Tarta, Gopala Krishna R. Kakivaya
-
Patent number: 9081654Abstract: Detecting failures of interconnected machines. A method includes establishing a machine to machine lease at a first machine using a first lease agent at the first machine to a second lease agent at a second machine as a result of an application on the first machine requesting to establish a lease with an application on the second machine. Using the machine to machine lease, the method further includes detecting a communication failure between the first machine and the second machine or a machine failure of the second machine.Type: GrantFiled: January 18, 2013Date of Patent: July 14, 2015Assignee: Microsoft Technology Licensing, LLCInventors: Lu Xun, Mihail Gavril Tarta, Yang Li, Gopala Krishna R. Kakivaya
-
Patent number: 8990434Abstract: Embodiments include establishing and maintaining a consistent replica set within the federation infrastructure. A replica set, including a primary node and secondary nodes, is established from among nodes in a ring of nodes. An occurrence of a replica set configuration event affecting at least one of the replica set members is indicated. Based on the indication and based on a type of the replica set configuration event, it is determined that the replica set is to be reconfigured. The replica set is reconfigured according to a reconfiguration appropriate for the type of the replica set configuration event.Type: GrantFiled: August 30, 2011Date of Patent: March 24, 2015Assignee: Microsoft Technology Licensing, LLCInventors: Richard L. Hasha, Lu Xun, Gopala Krishna R. Kakivaya, Dahlia Malkhi
-
Patent number: 8892626Abstract: Resources are organized into collections to facilitate more efficient and reliable resource access. Namespace managers communicate with one another to form a federation namespace infrastructure. The infrastructure efficiently routes, migrates, and processes namespace requests, such as, for example, namespace registration requests from providers requesting to manage portions of namespaces and lookup requests from consumers requesting access to managed resources. Resources are registered in and made accessible from multiple different namespaces. Resources are identified using nested queries that filter results at multiple levels of a hierarchical namespace.Type: GrantFiled: August 30, 2012Date of Patent: November 18, 2014Assignee: Microsoft CorporationInventors: Gopala Krishna R. Kakivaya, Richard L. Hasha
-
Publication number: 20140208173Abstract: Detecting failures of interconnected machines. A method includes establishing a machine to machine lease at a first machine using a first lease agent at the first machine to a second lease agent at a second machine as a result of an application on the first machine requesting to establish a lease with an application on the second machine. Using the machine to machine lease, the method further includes detecting a communication failure between the first machine and the second machine or a machine failure of the second machine.Type: ApplicationFiled: January 18, 2013Publication date: July 24, 2014Applicant: MICROSOFT CORPORATIONInventors: Lu Xun, Mihail Gavril Tarta, Yang Li, Gopala Krishna R. Kakivaya
-
Publication number: 20140207925Abstract: Determining if a new federation should be formed. A method includes a voter node determining that it has sufficient votes to form a new federation. The method further includes determining that no node existing in a previous federation already has a quorum of valid global tickets. Each global ticket indicates that a node agrees that a federation should continue to exist. As a result, the voter node forms a new federation.Type: ApplicationFiled: January 18, 2013Publication date: July 24, 2014Applicant: Microsoft CorporationInventors: Lu Xun, Alex Wun, Gopala Krishna R. Kakivaya, Rishi Rakesh Sinha
-
Patent number: 8724645Abstract: The present invention extends to methods, systems, and computer program products for performing computations in a distributed infrastructure. Embodiments of the invention include a general purpose distributed computation infrastructure that can be used to perform efficient (in-memory), scalable, failure-resilient, atomic, flow-controlled, long-running state-less and state-full distributed computations. Guarantees provided by a distributed computation infrastructure can build upon existent guarantees of an underlying distributed fabric in order to hide the complexities of fault-tolerance, enable large scale highly available processing, allow for efficient resource utilization, and facilitate generic development of stateful and stateless computations. A distributed computation infrastructure can also provide a substrate on which existent distributed computation models can be enhanced to become failure-resilient.Type: GrantFiled: December 9, 2010Date of Patent: May 13, 2014Assignee: Microsoft CorporationInventors: Mihail Gavril Tarta, Gopala Krishna R. Kakivaya
-
Publication number: 20130290398Abstract: The present invention extends to methods, systems, and computer program products for performing computations in a distributed infrastructure. Embodiments of the invention include a general purpose distributed computation infrastructure that can be used to perform efficient (in-memory), scalable, failure-resilient, atomic, flow-controlled, long-running state-less and state-full distributed computations. Guarantees provided by a distributed computation infrastructure can build upon existent guarantees of an underlying distributed fabric in order to hide the complexities of fault-tolerance, enable large scale highly available processing, allow for efficient resource utilization, and facilitate generic development of stateful and stateless computations. A distributed computation infrastructure can also provide a substrate on which existent distributed computation models can be enhanced to become failure-resilient.Type: ApplicationFiled: June 24, 2013Publication date: October 31, 2013Inventors: Mihail Gavril Tarta, Gopala Krishna R. Kakivaya