Microsoft Technology Licensing, LLC

Bart J F De Smet

Douglas Christopher Burger

Blaise Aguera Y Arcas

Daniel Massey

Saar Yahalom

Henricus Johannes Maria Meijer

Balan Sethu Raman

Alexander Douglas James

Tihomir Tsvetkov Tarnavski

Colin Joseph Meek

Eric Anthony Rozell

Savas Parastatidis

Rafael De Jesús Fernández Moctezuma

Techniques for utilizing a metric tracking agent to track how resources are used to process a payload across different network boundaries are disclosed herein. A process that is to be performed on a payload within a boundary is identified. A metric tracking agent is also identified, where this metric tracking agent defines a scope of the process and is associated with a metric counter used to determine a metric value for the process. While the process is being performed in accordance with the defined scope, the metric value is calculated so as to reflect the resource usage expended by the network boundary and is logged by a log associated with the metric tracking agent. The metric tracking agent, which includes the metric value, is then provided to either a subsequent system boundary or to a metric store.

Generalized resource accountant

A data processing system that provides access to operator state information includes a plurality of operators that are configured to perform a computation with respect to data received from data sources. State information is associated with at least one of the plurality of operators. The data processing system also includes an object graph that comprises a representation of the computation, and that may dynamically change at runtime. The data processing system also includes an interface that provides access to the state information via the object graph. The data processing system also includes a query manager that is executable to process a graph query to retrieve the state information by traversing a plurality of nodes within the object graph. Temporal navigation is also supported. Thus, processing a graph query may involve navigating to a node in the object graph at a certain point in time.

Providing access to state information associated with operators in a data processing system

Optimization opportunities are located and documented to enhance code translation by compilers or interpreters. An enhanced translator scans a program syntax graph, recognizes subgraph structures, and annotates nodes of the graph to document optimization characteristics of program code entities associated with the nodes. Subgraph structures and corresponding annotations may be maintained in an optimization catalog, distinct from any particular optimizable program. Optimizers improve program code translation based on the annotated syntax graph. Optimization characteristics may specify code purity in terms of execution value ranges and execution behaviors, e.g., side-effects, local or global variable usage, I/O, by-reference parameters, and which exceptions are possible. Subgraph structures may be identified using routine names, hash values, and templates with holes any constant will fill. Parent node characteristics may be inferred from characteristics of child nodes. Optimization candidates may be prioritized using weight functions. Optimizer callbacks may be inserted to evaluate optimization characteristics incrementally.

Persistent annotation of syntax graphs for code optimization

Stream-based programming models allow subscriber to observe a stream of stream items received from a source, such as event notifications and updates to observed data. Presented herein is a stream-based reactive programming platform that allows observers to discover sources and streams, and to specify queries applicable to sources that results in new streams, including conditions that apply to the properties of a federation of sources. Variations of the reactive programming platform include generating a new stream from a non-reactive data source; generating a graph of sources and observers; and providing a directory of discoverable elements respectively identified by uniform resource identifiers. The reactive stream-based programming platform may also permit parameterization to configure the functionality of the elements participating in the stream; delegation of query tasks to discoverable elements of the programming platform; and federation of a heterogeneous set of elements to achieve a query using the reactive stream-based programming platform.

Stream-based reactive programming platform

Representative embodiments disclosed compress expressions so they utilize less physical storage. An expression is placed in a standard representation, such as an expression tree. The system utilizes one or more rules to identify portions of the expression that are likely to be common to other expressions. The common portions are extracted from the expression tree as a template and the remaining portions are hoisted from the expression as unique portions. If the template does not already reside in a cache, the template is stored in the cache. A cache reference is obtained for the template and combined with the unique portions to create a bundle that reduces storage requirements for the expression. The original expression is recovered by retrieving the template from the cache using the cache reference and placing the hoisted unique portions into their original locations in the template.

Reducing memory usage for long standing computations

Systems and methods for providing client-side integration of apps and services is provided. An integration framework execution upon a computing device provides integration of various apps, applications, services, sensors and the like. Upon receiving a request for a service, the integration framework accesses a registry of a plurality of services of a respective plurality of providers registered with the integration framework. Each of the services is registered with the integration framework is associated with a trust level of a hierarchy of trust levels. The integration framework iteratively searches the registry for a provider of the requested service according to the hierarchy of trust levels, beginning with the most trusted level of the trust levels to the less trusted trust level until a provider of the requested service is found or until all levels of the hierarchy are searched without finding a provider of the requested service.

Client-side integration framework of services

Systems and methods of a personal daemon, executing as a background process on a mobile computing device, for providing personal assistant to an associated user is presented. Also executing on the mobile computing device is a scheduling manager. The personal daemon executes one or more personal assistance actions on behalf of the associated user. The scheduling manager responds to events in support of the personal daemon. More particularly, in response to receiving an event the scheduling manager determines a set of apps that are responsive to the received event and from that set of apps, identifies at least a first subset of apps for execution on the mobile computing device. The scheduling manager receives feedback information regarding the usefulness of the executed apps of the first subset of apps and updates the associated score of each of the apps of the first subset of apps.

Incentive-based app execution

Evaluating an expression tree. A method includes, at a first domain, accessing an expression tree. The expression tree comprises a plurality of nested expressions. The plurality of nested expressions spans a plurality of domains. The expressions in the expression tree are expressed in a common format in spite of the different expressions of the expression tree being intended to be evaluated by different domains. At the first domain, the method includes evaluating one or more references to local variables included in the plurality of nested expressions. The method further includes determining that one or more expressions in the plurality of expressions are to be evaluated by a different domain. The method further includes expanding the one or more expressions in the plurality of expressions to be evaluated by different domains to allow the one or more expressions to be evaluated by the different domain.

Growing community of inventors

Bellevue, WA, United States of America

Bart J F De Smet