Microsoft Technology Licensing, LLC

Dragos Barac

Robert Lovejoy Goodwin

Prakash Sikchi

Pedram Faghihi Rezaei

Miladin Pavlicic

Arungundram C Narendran

Kelvin Shek Yiu

Shiraz Jitendra Cupala

Karthik Pattabiraman

Janaina Barreiro Gambaro Bueno

Rajesh K Jha

Sitaramaswamy V Lanka

Javier Garcia Flynn

Brian M Jones

Robert Andrew Little

Marcin Sawicki

Tristan Davis

Ali Taleghani

Brandon V Taylor

Stephen John Mooney

Raj B Merchant

Ranjan Aggarwal

Rajesh J Jha

Krystian Krzysztof Walec

Abhinav Jain

Tristan A Davis

This document relates to compilation of source code into services. One example method involves receiving input source code, identifying data dependencies in the input source code, and identifying immutability points in the input source code based at least on the data dependencies. The example method also involves converting at least some of the input source code occurring after the immutability points to one or more service modules.

Compilation and execution of source code as services

A technique is described herein that intelligently deploys resources in a data center for a new program. The new program has, at least in part, unknown runtime characteristics. The technique involves collecting plural input factors that provide evidence of an expected runtime behavior of the new program. It does so by identifying at least one related program that differs from the new program, but has a specified degree of relatedness to the new program. The collecting operation then obtains information that describes an amount of resources that the related program(s) consume when run. Based on at least some of the plural input factors, the technique generates an estimated amount of resources that the new program is expected to consume when it is run. The technique then determines and deploys a configuration of resources in the data center that will provide the estimated amount of resources.

Estimating an amount of resources that a program is expected to consume in a data center

A technique is described herein for updating a running application that includes a plurality of program modules (e.g., services). The technique performs its updating operation without having to suspend the execution of the running application, and without reloading all of the program modules in the running application. The technique leverages a mapping component to map a calling program module's call to a function to a called program module that implements the function. A current application manifest provides mapping logic for use by the mapping component. In some examples, the technique also transforms data passed by the calling program module to conform to a data format expected by the called program module. This is appropriate when the calling program module and the called program module use different schemas to define the data.

Modifying program modules in running applications

One or more data stores are maintained separately from a primary presentation storage within a document for storing, relating and for allowing use of arbitrary data that is associated with a computer-generated document between multiple data consumers. The data store exposes application programming interfaces (APIs) to the various pieces of data in the data store for allowing different data consumers to access and operate on one or more of the data pieces in real time. Multiple data consumers may access and edit the same piece of data concurrently, and any conflicting changes to a given piece of data are resolved. Each data consumer may accept or reject the change as well as make additional side-effect changes as a result of the original change. In this way, the data may be synchronized in real time across the data consumers.

Real-time synchronization of XML data between applications

Tool(s) enabling installation of a solution are described. These tool(s) may follow appropriate security precautions to contain possibly dangerous code in a data file's solution even when the solution is installed from a local source, such as when a user is offline. These tool(s) determine what level of security is appropriate for a data file's solution based on the original source of the solution. The tool(s) may also and/or instead enable a user to edit a data file without the user having to discover or deploy a solution application governing the data file.

Installing a solution

This document describes a system and method that incrementally transforms and renders changes to a hierarchical data file. This system and method allows a user to incrementally see changes that the user has made to the hierarchical data file through entry of data in a rendered form. A hierarchical data processing engine may perform partial transformations of data files and produce partial rendering files of changes made to data files. By so doing, the hierarchical data processing engine improves a user's editing experience by allowing for quicker updating of the rendered form being edited by the user.

System and method for incrementally transforming and rendering hierarchical data files

A system and method that enables a user to edit a data file offline is described. This system and method can enable a user to edit a data file without the user having to discover or deploy a solution application governing the data file. For security, this system and method can deploy a solution application within a sandbox, thereby limiting the operations the solution application can perform.

System and method for offline editing of data files

Systems and methods are disclosed for creating document schema. The disclosed systems and methods may include receiving schema corresponding to meta-data associated with a document, storing the schema in the document, and storing the meta-data in the document. Furthermore, the disclosed systems and methods may include storing the schema at a first location. The schema stored at the first location may be changeable independent of the schema stored in the document. In addition, the disclosed systems and methods may include creating a first hash of the schema stored in the document and storing the first hash in the document. Moreover, the disclosed systems and methods may include determining that the schema stored at the first location has changed if a second hash of the schema stored at the first location is different from the first hash of the schema stored in the document.

Methods and systems for creating document schema

Growing community of inventors

Bellevue, WA, United States of America

Dragos Barac