International Business Machines Corporation

Microsoft Technology Licensing, LLC

Haibo Lin

Yan Li

Yudong Yang

Zhicheng Yin

Jaliya Nishantha Ekanayake

Tao Guan

Jingren Zhou

Eric Boutin

Xiaoyu Chen

Paul Michael Brett

Nan Zhang

Anna Korsun

Pavel N Iakovenko

Yi Zhao

John Kevin O'Brien

Tong Chen

Tao Zhang

Liu Tao

Zhong Zheng

Yu Meng Li

Tao Liu

Yonghua Lin

Kai Zheng

Zhe Xiang

Marc Todd Friedman

Li Hui Guo

Liya Fan

Wen Bo Shen

Guan Cheng Chen

Raghunath Ramakrishnan

Jia Jia Wen

Jin Sun

Yongchul Kwon

José A Blakeley

Ming Li

Xu U Wang

Silan Wang

A comment quality system for improving comments for source code includes a processor and memory. An operating system is executed by the processor and memory. A comment quality application, executed by the processor and memory, is configured to receive data relating to a number of source code comments that are associated with source code developed in a code developer application, generate a desired number of comments based on an estimated quality of comments for a code developer and a number of reviewers of the source code, and send feedback to the code developer application based on the desired number of comments for the source code and the number of source code comments.

Systems and methods for determining and enforcing the optimal amount of source code comments

Processing a job request for multiple versions of a distributed computing service. The service processing node does this by at least interleavingly (e.g., via time sharing with rapid context switching, or by actually concurrently) running a first runtime library associated with a first service version of the distributed computerized service and a second runtime library associated with a different service version of the distributed computerized service. While running the first runtime library, job requests of a first service version may be at least partially processed using a first set of one or more executables that interact with the first runtime library. While running the second runtime library, job requests of a second service version may be at least partially processed using a second set of one or more executables that interact with the second runtime library.

Processing requests for multi-versioned service

Processing received job requests for a multi-versioned distributed computerized service. For each received job request, the job request is channeled to an appropriate service processing node that depends on the version of the distributed computing service that is to handle the job request. A version of the distributed computing service is assigned to the incoming job request. A service processing node that runs a runtime library for the assigned service version is then identified. The identified service processing node also has an appropriate set of one or more executables that allows the service processing node to plan an appropriate role (e.g., compiler, scheduler, worker) in the distributed computing service. The job request is then dispatched to the identified service processing node.

Processing request for multi-versioned service

Aspects extend to methods, systems, and computer program products for optimally pipelining result sets with fault tolerance in distributed query execution. Distributed computing jobs are optimized by dividing the distributed computing jobs into one or more bubbles for execution. Each bubble can be independently executed, potentially in parallel with other bubbles, when resources to handle the bubble are available. Intra-bubble communication can be streamed between vertices within a bubble. Inter-bubble communication can be stored to durable storage. Bubbles provide a failure boundary for a job graph and re-executing a bubble along with storage of intermediate results in durable storage can be used to recover from failures. When a vertex inside a bubble fails, computation can resume by rescheduling the execution of the failed bubble from the durable inputs for that bubble. Durable storage provides a light-weight failover to handle non-deterministic behavior. Jobs can also leverage streaming to increase performance.

Optimizing pipelining result sets with fault tolerance in distributed query execution

The upgrading of a relational database on multiple of machines (e.g., a service) that perform data operations via stored procedures. The upgrade occurs without changing the functionality of the set of one or more stored procedures. Accordingly, even if the machine itself is not upgraded, the machines can still interface with the database via the set of one or more stored procedures. The upgrade of the relational database occurs by adding occur by adding new table(s) to the relational database, and thereafter adding new stored procedures to the stored procedure store, the new stored procedures referencing parameters of the new tables. Since the machines that interface with the relational database can still operate on the upgraded database using the old stored procedures, each machine may then be upgraded in an orderly manner to interface with the new stored procedures.

Database and service upgrade without downtime

An information processing method for a touch screen device includes in response to contact of a user's finger with a touch screen of the touch screen device, identifying the finger contacting the touch screen; determining key(s) corresponding to the identified finger based on set correspondence relationship(s) between the finger(s) and the key(s); and displaying at least one character represented by the key(s) corresponding to the identified finger.

Information processing method and apparatus for a touch screen device

A method, apparatus, and system for monitoring the state of a fluid transport pipe. In one embodiment, there is provided a method of monitoring the state of a fluid transport pipe, the method including: causing a monitor to move along with a fluid inside the fluid transport pipe, the monitor including an elastic gas container and being configured to adjust the volume of the elastic gas container based on ambient pressure of the elastic gas container; and measuring and recording, by the monitor, one or more types of environmental data inside the fluid transport pipe for determining the state of the fluid transport pipe. In other embodiments, there are further provided an apparatus and system for monitoring a state of a fluid transport pipe.

Monitoring state of fluid transport pipe

A combinational computing apparatus and method. The combinational computing method includes the steps of: receiving a first setting relating to multiple groups of input data and a second setting relating to a combinatorial mode among multiple groups of input data, obtaining the data combination of the multiple groups of input data according to the first setting and the second setting, and performing a desired calculating operation on the data combination.

Combinatorial computing

Rule based combinatorial computing for map/reduce platform

A co-processor system and a method for loading an application to a local memory of a co-processor system. In the method, re-locatable code and descriptive data are copied from a loading region to a non-loading region. An executable image to be loaded is loaded using the re-locatable code copied to the non-loading region according to the descriptive data. The local memory includes a loading region and a non-loading region, the loading region stories a loader and descriptive data of an executable image to be loaded of the application, and the loader includes re-locatable code. A system is provided for carrying out the steps of the method. In accordance with the system and method of the present invention, flexibility of co-processor system application development is improved without occupying additional storage space.

Method and system for loading application to a local memory of a co-processor system by using position independent loader

Reducing runtime coherency checking using global data flow analysis is provided. A determination is made as to whether a call is for at least one of a DMA get operation or a DMA put operation in response to the call being issued during execution of a compiled and optimized code. A determination is made as to whether a software cache write operation has been issued since a last flush operation in response to the call being the DMA get operation. A DMA get runtime coherency check is then performed in response to the software cache write operation being issued since the fast flush operation.

Reducing runtime coherency checking with global data flow analysis

Simplifying transmission in a distributed parallel computing system. The method includes: identifying at least one item in a data input to the parallel computing unit; creating a correspondence relation between the at least one item and indices thereof according to a simplification coding algorithm, where the average size of the indices is less than the average size of the at least one item; replacing the at least one item with the corresponding indices according to the correspondence relation; generating simplified intermediate results by the parallel computing unit based on the indices; and transmitting the simplified intermediate results. The invention also provides a system corresponding to the above method.

System and method for simplifying transmission in parallel computing system

Compiler analysis and runtime coherency checking for reducing coherency problems is provided. Source code is analyzed to identify at least one of a plurality of loops that contains a memory reference. A determination is made as to whether the memory reference is an access to a global memory that should be handled by at least one of a software controlled cache or a direct buffer. A determination is made as to whether there is a data dependence between the memory reference and at least one reference from at least one of other direct buffers or other software controlled caches in response to an indication that the memory reference is an access to the global memory that should be handled by either the software controlled cache or the direct buffer. A direct buffer transformation is applied to the memory reference in response to a negative indication of the data dependence.

Computer analysis and runtime coherency checking

An encoding method and an encoder for encoding data transmitted in a manner of bursts via a parallel bus and a decoding method and a decoder. The encoding method includes organizing data of the bursts into matrixes, determining for each of the matrixes whether a transform mode capable of decreasing the bus transition number exists, determining that the matrix needs to be transformed, determining a transform mode for transforming the matrix, and replacing the initial matrix with the transformed matrix. Then, forming a new matrix to be transmitted from matrixes which do not need to be transformed and matrixes which have been transformed. Thereafter, first generating a transform information word indicating transform states of the respective matrixes and then attaching the transform information word to the matrix to be transmitted to form an encoded matrix for actual transmission.

Bus encoding/decoding method and bus encoder/decoder

Growing community of inventors

Beijing, China

Haibo Lin