Microsoft Technology Licensing, LLC

Akash Jeevan Sagar

Dharma Kiritkumar Shukla

Aditya G Bhandarkar

Robert Brian Schmidt

George P Moromisato

Raymond Edward Ozzie

Muthukaruppan Annamalai

Nathan Christopher Talbert

Mayank Mehta

Asad Jawahar

Abhay Vinayak Parasnis

Richard Y Chung

Richard Yiu-Sai Chung

Jack E Ozzie

Kumarswamy P Valegerepura

Raymond Edward Endres

Karthik Raman

Paresh S Suthar

Matthew S Augustine

Noah Benjamin Edelstein

Anthony Dean Andrews

Jean-Emile Elien

William D Devlin

Kevin Bowen Smith

Vladimir Dmitri Fedorov

Bimal Kumar Mehta

Sanjib Saha

Johannes Klein

Paul Maybee

David Richard Reed

Lee B Graber

Michael Steven Vernal

Balinder Malhi

Siunie A Sutjahjo

Yossi Levanoni

Wei-Lun Lo

Anandhi Somasekaran

Derek Norman LaSalle

Jim Murphy

Dennis Pilarinos

Allen Zhang

Bob Schmidt

Todd R Manion

Israel Hilerio

Ori Amiga

Farookh P Mohammed

David T Fong

Eddie Fusaro

Nishant Gupta

Sergey Chub

Yao Lu

Mark Nathan Wain

Nitin Sharma

Ravi S Vedula

Muralidhara Varma Chiluvuri

Eli Hisdai

Abhay c/o Microsoft Corp Parasnis

Optimistic concurrency is effectuated to manage constraints in a synchronization environment at multiple computing device endpoints in a consistent fashion without utilizing concentrated centralized constraint logic. Implemented data synchronization constraints that identify false violation scenarios may be automatically resolved without user intervention by using an etag system directed by a master component to assist computing device endpoints to maintain data synchronization among them. Data entries defining each file hierarchy component to be synched are generated and shared with the master component and each computing device endpoint in a synchronization environment. Individual computing device endpoints can use the data entries generated locally with those generated by other computing device endpoints to locally resolve identified false violation scenarios.

Optimistic concurrency utilizing distributed constraint enforcement

A distributed component model for creating a scalable and available distributed application is disclosed. The distributed component model provides for an application schema to be declaratively defined to include a module having a component. The schema includes a corresponding definition construct in a technology agnostic manner. The corresponding definition construct is declaratively defined to include metadata to control scaling and availability.

Distributed component model

A method of creating an application definition for a distributed application is disclosed. Constructs corresponding with a schema of the distributed application are defined in a declarative and technology agnostic manner. The constructs include the application definition, a module definition, and a component definition. Each construct includes metadata.

Distributed application definition

Embodiments are directed to providing an application model for implementing composite applications and to providing a declarative programming model and distributed runtime for creating and executing composite applications. In an embodiment, a computer system instantiates an application model. The application model allows users to compose composite applications. The composite applications are configured to run on both distributed computing systems and local computing systems. The computer system receives user input at the instantiated application model. The user input indicates which composite application components are to be used in conjunction with each other to form the composite application. The computer system also provides the composite application on a distributed computing system and/or a local computing system.

Application model for implementing composite applications

A method for of authoring and executing stateful components for a distributed application is disclosed. An application schema for the distributed application is declaratively defined and includes a plurality of distributed modules. Each module hosts a set of stateful components co-located in a physical tier of a distributed environment having logic to manipulate state. The runtime supports partitioning the stateful components. Control flow opaqueness of component logic is banished in each of the stateful components, which would otherwise occur if state was externalized.

Stateful component authoring and execution

Data files, applications and/or corresponding user interfaces may be accessed at a device that collaborates in a mesh. The mesh may include any number or type of devices that collaborate in a network. Data, applications and/or corresponding user interfaces may be stored within a core object that may be shared over the mesh. Information in the core object may be identified with a corresponding user such that a user may use any collaborating device in the mesh to access the information. In one example, the information is stored remotely from a device used to access the information. A remote source may store the desired information or may determine the storage location of the desired information in the mesh and may further provide the desired information to a corresponding user.

Mesh-managing data across a distributed set of devices

A file system watcher in the presence of different file systems to allow synchronization of replicated files distributed among different file systems without compromising the features of each file system is described. To synchronize the distributed replications, a platform independent synchronization manager creates a file system watcher for each file system associated with a replication of the file. The file system watcher monitors each object for events affecting the object or the object's constituent files, such as creation, deletion, change and rename. Notifications are sent to the synchronization manager, which consolidates the modifications and updates a locally stored replication, if necessary. The synchronization manager then sends a notification of an update to other synchronization managers for replications of the distributed file or folder. Synchronization is complete when the nonconforming synchronization managers acquire a replication of the locally stored replication and update their respective objects.

Synchronization of replications for different computing systems

A file fetcher manager provides commonly-utilized management and resource allocation for multiple file fetchers that each implement a different type of mechanism or protocol for transferring data files between peer endpoints in meshes associated with a cloud-computing service. Each file fetcher is configured with both client-side and server-side components to retrieve and serve out data files. The file fetcher manager encapsulates the file fetchers to provide an abstract interface to callers while hiding the underlying details of the file fetchers. The file fetcher manager is arranged for managing simultaneous operations of the multiple file fetchers to route requests from the callers to the appropriate file fetchers, and for scheduling work items for the file fetchers so that data transfers efficiently utilize available resources while keeping the entire transfer process coherent and organized.

Managing data transfer between endpoints in a distributed computing environment

Systems and methods for synchronizing data between endpoints using elements of centralized and decentralized synchronization systems and communication topologies are disclosed. Such systems and methods may in some cases synchronize some subset of data with a centralized endpoint while another subset of data is synchronized in a decentralized fashion directly with other endpoints. Such systems and methods may include a variety of cooperative functionality to assist in the synchronization of data between endpoints.

Server-assisted and peer-to-peer synchronization

A unified data access mechanism can provide transparent access to data that is either stored locally or remotely. Application programs can direct data requests and data modifications to this singular component without foreknowledge of where the data is stored. The unified data access mechanism can work in concert with a synchronization mechanism that can maintain data synchronization between local data and remote data. Requested or modified data can be identified as stored locally or remotely based on the namespace of the data. If the data is stored remotely, the user credentials associated with the user's process space within which the application program is executing can be utilized to identify, and then provide, relevant authentication information to the remote data store, should it be required.

Transparent access mechanism for local and remote data

Growing community of inventors

Redmond, WA, United States of America

Akash Jeevan Sagar