Microsoft Technology Licensing, LLC

Gopala Krishna R Kakivaya

Richard L Hasha

Lu Xun

Jonathan C Hawkins

Christopher Wellington Brumme

Manish S Prabhu

Caleb L Doise

Tarun Anand

Stephen Peter De Jong

Joseph L Roxe

Mihail Gavril Tarta

Raja Krishnaswamy

Lance Olson

Henry L Sanders

Sean Edwin Trowbridge

James S Miller

Brian M Grunkemeyer

Stefan Harrington Pharies

David S Mortenson

Dahlia Malkhi

Thomas Lee Rodeheffer

Erik B Christensen

Anders Hejlsberg

Michael M Magruder

David Bau

Brian LaMacchia

David S Ebbo

Julie D Bennett

Travis Muhlestein

Krzysztof J Cwalina

Seth Mitchell Demsey

Shawn Patrick Burke

Christopher L Anderson

Loren Kohnfelder

Yung-Shin Lin

Anthony J Moore

Erik B Olson

Yann Christensen

Fabio A Yeon

Jeffrey M Cooperstein

James H Hogg

Craig T Sinclair

Corina Eva Feuerstein

Adam Wade Smith

Alan Geoffrey Boshier

Shajan Dasan

Radu Rares Palanca

John I McConnell

Suzanne Maurine Cook

Ramasamy Krishnaswamy

Hany E Ramadan

Jesus Ruiz-Scougall

Joe Dennis Long

Jayanth V Rajan

Daniel Takacs

Christopher G Kaler

Gregory Darrell Fee

Hervey O Wilson

David Owen Driver

Donald F Box

Vance Palmer Morrison

David E Langworthy

Dmitry Robsman

Douglas M Purdy

Natasha Harish Jethanandani

Sowmyanarayanan K Srinivasan

Christian F Huitema

Steven E Lucco

Yang Li

Yan Valerie Leshinsky

Stephen James Millet

Giovanni Moises Della-Libera

Nikhil Kothari

Bradford H Lovering

Scott David Guthrie

David N Cutler

Jeffrey Bruce Parham

James M Lyon

Jeffrey C Schlimmer

Luca Bolognese

Keith W Ballinger

Brian Keith Pepin

Mark T Anders

Jun Fang

Susan M Warren

Stephen T Swartz

Manu Vasandani

Robert Michael Howard

Nicholas M Kramer

Chad W Royal

Mark W Fussell

Mark A Boulter

Sreeram Nivarthi

Kumar Gaurav Khanna

Omri Gazitt

Nithyalakshmi Sampathkumar

Neetu Rajpal

Savithri N Dani

Subramanian Ramaswamy

Rishi Rakesh Sinha

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.

Data-aware orchestration

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.

Transactional distributed lifecycle management of diverse application data structures

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.

Cluster voter model

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.

Establishing causality order of computer trace records

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.

Maintaining consistency within a federation infrastructure

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.

Organizing resources into collections to facilitate more efficient and reliable resource access

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.

Performing computations in a distributed infrastructure

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.

Common lease agent for cluster communication

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.

Data consistency within a federation infrastructure

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.

Methods, systems and computer program products are provided for rendezvousing resource requests with corresponding resources. Doubly linked sorted lists are traversed using modulo arithmetic in both directions. Sorted lists can be partitioned based on a multiple proximity metrics. Node routing tables provide a logarithmic index to nodes within the ID space of the federation infrastructure to facilitate more efficient routing. Messages can be routed to nodes within a ring and proximally routed to nodes in other partitioned rings.

Rendezvousing resource requests with corresponding resources

A computational system determines that a joining node in the federation infrastructure desires to join an identified subfederation within the federation infrastructure. The system accesses the joining node's group table, where the group table includes membership information identifying subfederations within the federation infrastructure. Each node in the federation maintains neighborhood information for each subfederation of which the node is aware. The system determines that no entry for the identified subfederation exists in the joining node's group table and, based on the determination, routes a group join message to a rendezvous point within the federation infrastructure. The rendezvous point checks its group table for an entry corresponding to the identified subfederation. The system also receives an indication from the rendezvous point indicating that the rendezvous point's group table does not include a corresponding entry for the identified subfederation and that the joining node is the first member of the identified subfederation.

Subfederation creation and maintenance in a federation infrastructure

A replicated finite state machine lock service facilitates resource sharing in a distributed system. A lock request from a client identifies a resource and a lock-mode, and requests a leaseless lock on the resource. The service uses client instance identifiers to categorize requests as duplicate, stale, abandoned, or actionable. A lock may be abandoned when a client holding the lock goes down. After a per-client abandonment timer expires, the lock service may treat any exclusive lock granted to the client as abandoned, and treat any non-exclusive lock granted to the client as unlocked. The service tries to notify a lock-holding client if another client requests the same lock, and treats the lock as abandoned if the notification attempt fails. An abandoned read lock is granted to a different client on request. An abandoned write lock is granted or refused depending on whether the requesting client accepts abandoned write locks.

Fabric based lock manager service

Growing community of inventors

Sammamish, WA, United States of America

Gopala Krishna R Kakivaya