Patent application number | Description | Published |
20140365787 | SCENARIO POWER MANAGEMENT - One or more techniques and/or systems are provided for dynamically applying power policies to a computing environment. For example, a computing environment may comprise one or more activity components (e.g., a display driver, an audio driver, an application, etc.) that may provide status information used to identify a scenario (e.g., a video game scenario, a full screen video playback scenario, etc.) that is activated for the computing environment. A power policy assigned to a currently identified scenario may be applied to the computing environment to dynamically improve performance and/or power conservation, for example. Activity components, scenarios, and/or power policies may be maintained in an extensible manner such that activity components, scenarios, and/or power polices may be added, removed, and/or modified by merely updating corresponding data structures, such as tables or registry keys, as opposing to updating power management software code. | 12-11-2014 |
Patent application number | Description | Published |
20090210454 | FILE SYSTEM WATCHER IN THE PRESENCE OF DIFFERENT FILE SYSTEMS - The claimed subject matter is directed to 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. 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 all other synchronization managers for all 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 to conform therewith. | 08-20-2009 |
20100082534 | Method and System of Managing Conflicts for a Set of Synchronized Folders - Generally, the described system and process enables resolution of conflicts in a synchronized folder. Within the described mesh operating environment, each of the devices may be configured to do the same processing so that the file system view of the synchronized folder looks the same on all devices (pending local capabilities). Updates that cannot be immediately realized to the local store due to conflicts may be deferred for later attempts when, for example, additional updates at the system level or local level are made to resolve or eliminate the conflict for the update item. Generally, further changes may be propagated by a user in addressing a particular conflict that the user is notified about (e.g., via a selected winner that the user disagrees with). Alternatively, the conflict may resolve itself when a further update occurs that overrides or renders moot the previous update (e.g., a deleted item having a modified enclosure, where the enclosure had a previous concurrency conflict). | 04-01-2010 |
20120117025 | Synchronization of Replications for Different Computing Systems - 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. | 05-10-2012 |
Patent application number | Description | Published |
20080276181 | Mesh-Managing Data Across A Distributed Set of Devices - 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. | 11-06-2008 |
20080317068 | SERVER-ASSISTED AND PEER-TO-PEER SYNCHRONIZATION - 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. | 12-25-2008 |
20080320055 | Bi-Directional Data Modification With Synchronization - Systems and methods for synchronizing data between endpoints, including the modification of data on an endpoint without necessarily modifying data that is communicated between endpoints are disclosed. In such systems and methods the representation of data on an endpoint may be modified so that constraints on that particular endpoint are enforced, without requiring a similar or the same modification to the data when it is synchronized to other endpoints. | 12-25-2008 |
20090112870 | MANAGEMENT OF DISTRIBUTED STORAGE - Systems and methods of distributed storage are disclosed herein. A request to store data in a client computer is received. A request is sent from the client computer to a storage service to create a core object such that the core object can be created with a member entry to a member feed in the core object. The member feed can be indicative of one or more entities that are permitted to access to the core object. A message is received at the client computer with the core object. A replica of the core object on the client computer is created. The client computer can add the data as a data entry to a data feed in the core object. An updating message is sent to the storage service. The message can include a copy of the replica of the core object including the data entry. | 04-30-2009 |
20110035355 | Bi-Directional Data Modification With Synchronization - Systems and methods for synchronizing data between endpoints, including the modification of data on an endpoint without necessarily modifying data that is communicated between endpoints are disclosed. In such systems and methods the representation of data on an endpoint may be modified so that constraints on that particular endpoint are enforced, without requiring a similar or the same modification to the data when it is synchronized to other endpoints. | 02-10-2011 |
20110040850 | MESH-MANAGING DATA ACROSS A DISTRIBUTED SET OF DEVICES - 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. | 02-17-2011 |
20110173157 | Bi-Directional Data Modification With Synchronization - Systems and methods for synchronizing data between endpoints, including the modification of data on an endpoint without necessarily modifying data that is communicated between endpoints are disclosed. In such systems and methods the representation of data on an endpoint may be modified so that constraints on that particular endpoint are enforced, without requiring a similar or the same modification to the data when it is synchronized to other endpoints. | 07-14-2011 |
20110295929 | Optimistic Concurrency Utilizing Distributed Constraint Enforcement - 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. | 12-01-2011 |
20120210020 | SERVER-ASSISTED AND PEER-TO-PEER SYNCHRONIZATION - 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. | 08-16-2012 |
20140358853 | Optimistic Concurrency Utilizing Distributed Constraint Enforcement - 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. | 12-04-2014 |
20150019490 | Optimistic Concurrency Utilizing Distributed Constraint Enforcement - 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 stag 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. | 01-15-2015 |
20150319247 | MESH-MANAGING DATA ACROSS A DISTRIBUTED SET OF DEVICES - 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. | 11-05-2015 |
Patent application number | Description | Published |
20090248693 | MANAGING DATA TRANSFER BETWEEN ENDPOINTS IN A DISTRIBUTED COMPUTING ENVIRONMENT - 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. | 10-01-2009 |
20090300169 | SYNCHRONIZATION THROTTLING BASED ON USER ACTIVITY - Synchronization of data across multiple endpoints in a mesh network that supports a data sharing service is throttled responsively to user activity in the network by monitoring the activity using a component in a mesh operating environment (“MOE”) runtime that is instantiated on each endpoint. The monitoring may include the collection of data that can be used to infer user activity, as well as data that explicitly indicates activity. State information is maintained so that data can be synchronized across the endpoints even when a user goes offline from the service. When the user logs on to the service, makes changes to a shared file, or the endpoint device starts up upon connection to a mesh network, throttling is performed by prioritizing work items associated with synchronization operations so that resources on the endpoint are not excessively consumed which could reduce the quality of the user experience. | 12-03-2009 |
20110307442 | TRANSPARENT ACCESS MECHANISM FOR LOCAL AND REMOTE DATA - 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. | 12-15-2011 |
20120159424 | DISTRIBUTED APPLICATION MANIFEST - A method of creating a manifest for a distributed application is disclosed. Components and composites of components of the distributed application are described in a technology agnostic manner. The description includes a definition of the scalability of the composites of components. | 06-21-2012 |
20120159425 | APPLICATION MODEL FOR IMPLEMENTING COMPOSITE APPLICATIONS - 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. | 06-21-2012 |
20120222003 | DISTRIBUTED APPLICATION DEFINITION - 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. | 08-30-2012 |
20120246613 | DISTRIBUTED COMPONENT MODEL - 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. | 09-27-2012 |
20120254109 | DISTRIBUTED COMPONENT RUNTIME - A method of creating a distributed application in a distributed component runtime is disclosed. An application schema including distributed modules is declaratively defined. Each module hosts a component having a corresponding logical address. Mapping the corresponding logical addresses to physical addresses at runtime virtualizes interactions between the components. | 10-04-2012 |
20120260227 | STATEFUL COMPONENT AUTHORING AND EXECUTION - 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. | 10-11-2012 |