Microsoft Technology Licensing, LLC

Paul Sean Harrington

Roshanak Zilouchian Moghaddam

Chen Wu

Spandan Garg

Neelakantan Sundaresan

C Douglas Hodges

Jean-Pierre Duplessis

Jason Joseph Weber

Rahul Sudhir Kumar

Anthony C Romano

Timothy R Sullivan

William N Hanlon

Mark Blelock Atherton

Kraig S Rury

Theodore H Roberts

Aaron T Burcham

James Kal Yu Lau

A computer implemented method includes accessing performance trace data for executed code of multiple services. Symbols corresponding to functions of the executed code are identified. First sequences of functions from the identified symbols are identified and a first performance threshold for each identified first sequence of functions is computed. The method includes receiving an incoming performance trace, detecting second sequences of functions from the incoming performance trace, identifying second sequences equivalent to the first sequences, and comparing performance of the identified second sequences to the first performance threshold for each of the equivalent first sequences to identify second sequences as comprising a performance bottleneck.

System and method for identifying performance bottlenecks

An automated system for detecting performance bugs in a program and for providing code recommendations to improve the performance of the program generates a code recommendation table from performance-related pull requests. The performance-related pull requests are identified in part from a classifier trained on semi-supervised data. A code recommendation table is generated from performance-related pull requests and is searched for similarly-improved code based on a set of difference features that includes structural and performance features of the before-code of a pull request that is not in the after-code.

Performance bug detection and code recommendation

An extensible software application utilizes rules to initiate a behavior that performs operations that customize the extensible software application in a preferred manner. The behavior is applied when pre-defined events occur during execution of the extensible software application. The rules are provided by a third party developer in metadata that is separate from the extension's program code. The rules are based on expressions that define the events that need to take place during the execution of the extensible software application before the behavior is applied.

Rule-based activation of behaviors in an extensible software application

Software execution with minimal impact deployment allows software to be executed on a system without first running a conventional installation process. Techniques are used to avoid any requirement of writing settings to restricted areas of operating system maintained data stores.

Software execution with minimal impact deployment

Systems and methods for applying both profile and user customizations to an application user interface are provided. Profile customizations, created for a specialized use or field, are adapted to an application user interface, which has command-menu-toolbar contributions from various add-in modules. The user has access to the customizations through a user interface. Then, as a user is customizing the application, through commands, toolbars, and menus, the user customizations are tagged. A priority and group is assigned to each customization to allow for relative positioning of each customization. The difference between the user's final desired state and a reset state is computed. This difference computation is used to track the changes made to the application and to assist in resets of the customizations.

Method and system for customizations in a dynamic environment

Accessing compactly stored map element information from memory using a received encoded identification reference which identifies a map element, such as a link or a node. A link represents a thoroughfare on a map and a node represents an end point of a thoroughfare on the map. A block number is determined and an offset value is determined from the map element's identification reference. The block number provides a memory address for the beginning of a block of memory representing a region of the map. The offset value is a memory offset relative to the block's memory address. If the block referenced by the block number has not yet been loaded, the block having information about the map element is loaded. Once loaded, the information about each link type of map element in the region is read. The link information is stored within a designated part of a block data structure. Additionally, the link information is used to reconstruct information about the map region's node type of map elements. Once reconstructed, the node information is stored within another part of the block data structure. The block data structure remains in a memory cache so that information about the map element can be quickly accessed while information about the map element remains compactly stored in the block of memory.

System and method for accessing compactly stored map element information

In a computer having a multithreaded operating system, a road-mapping program begins a best-route calculation in the background such that much of the calculation is completed before the user finishes providing inputs. In this manner, the user's perceived calculation time is shortened. The user is allowed to input any of a number of variables related to the best-route calculation. The calculation can be initiated without all of the variables necessary to finish it. The calculation is initiated upon the receipt of a predetermined variable, and predicts values for the unreceived variables. As each variable is received, the invention confirms that the predicted value for that variable is confirmed as correct. If the predicted value is incorrect, the calculation is restarted based on the actual value of that variable, in combination with predictions for the variables which have still not been received.

Growing community of inventors

Seattle, WA, United States of America

Paul Sean Harrington