Microsoft Technology Licensing, LLC

Merico, Inc.

Jinglei Ren

Thomas Moscibroda

Parveen Kumar Patel

Jacob Rubin Lorch

Lidong Zhou

Srinath Setty

Liang Chen

Yang Chen

Ying Yan

Eric Chang

Chieh-Jan Mike Liang

Yanjie Gao

Roland Vogl

Hezheng Yin

A tool is provided for evaluating contributions of different software developers to a software project, which considers both the structural value and non-structural value of each developer's contributions. Source code for the project is parsed to generate abstract syntax trees (ASTs) representing the code at different times during the project. The tool may perform both a structural value analysis and a non-structural value analysis of the code contributions of each developer. The structural value analysis for each developer may include a call-commit analysis of a call-commit graph generated from the ASTs to analyze function calls and commits attributable to each developer. The non-structural value analysis for each software developer may include identifying and classifying commits attributable to each developer based on impact of such commits on the project. The tool may then calculate a development value score for each developer based on the structural and non-structural metrics for each developer.

Systems and methods for evaluating code contributions by software developers

A method for controlling a redundant storage system is proposed. A write request to a redundant storage system is received (). A dataset that is to be written into the redundant storage system by the write request is determined (). A portion of the dataset is logged into the redundant storage system for data recovery in case that a fault occurs in the redundant storage system (). Thus, only a portion of the dataset is logged and the amount of the logged data may be reduced compared with the conventional redundant storage system. Further, the redundant storage system may be recovered in response to a fault occurring in the redundant storage system.

Storage system control

A computing device requests access to an application object from a remote storage system in order to locally execute application functionality without hosting application resources. An accessed object is associated with an intent in the storage system and locked. Locking an object in combination with an intent prevents computing devices that are not performing the intent from accessing the object. An intent defines one or more operations to be performed with the requested object, which are serialized as intent steps and stored in the storage system. Upon executing an intent step, the computing device stores a log entry at the storage system signifying the step's completion. A locked object remains locked until the log entries indicate every intent step as complete. Different computing devices can unlock a locked object by executing any incomplete steps of an intent associated with the locked object.

Intents and locks with intent

In implementations of the subject matter described herein, a new approach for controlling and tracing an object across a plurality of parties is proposed. A rule set may be enabled by the confirmation of a plurality of parties. The rule set may define constraints on operations related to the object. Upon receipt of a request for an operation related to the object, the requested operation may be verified based on the rule set agreed by the plurality of parties. In response to verifying that requested operation is valid, the requested operation may be performed, and a record for the operation may be created and stored in a blockchain database accessible to the plurality of parties.

Tracing objects across different parties

The subject matter described herein relates to a file system with adaptive flushing for an electronic device. The file system keeps data in memory much longer and its policy for flushing in-memory write cache to storage is application-aware and adaptive. More specifically, what parts of the cached data are ready for flushing could be determined according to the access characteristic of an application. In addition, when to do flushing can be selected flexibly at least partly based on user input interactions with an application of the electronic device or with the electronic device. Further, a multi-priority scheduling mechanism for scheduling data units that are ready to be flushed could be employed, which ensures fairness among applications and further improves flushing performance.

Flushing in file system

Growing community of inventors

Beijing, China

Jinglei Ren