International Business Machines Corporation

Yao Dong Qi

Zhi Da Luo

Yi Yang

Hai Shan Wu

Di Xu

Wei Li

Yong Sen Zheng

Xing Xing Shen

Lan Jun Wang

Wei Ying Yu

Chuang Tang

Yan Li

Peng Gao

Xu Lu

Steven Francis Best

Cheng Liu

Lanjun Wang

Xiao Jun Dai

Zhi Gan

Yang Che

Yan B J Li

Yong Z Y Zheng

Li-Fang Lee

Mo Jiong Qiu

A method of identifying a root cause in a distributed computing environment is provided including collecting metric data of a plurality of application components, collecting metric correlation relationship data, collecting topology relationship data, and collecting transaction tracking relationship data that indicates a group of the application components used to execute a requested transaction. A graph is generated including a plurality of nodes corresponding to the application components by merging the metric correlation relationship data, the topology relationship data, and the transaction tracking relationship data. The nodes of the graph are traversed in an order based on a bi-directional weight for each of a plurality of edges connecting neighboring nodes among the plurality of nodes. A recommendation list is generated including at least one abnormal application component. The recommendation includes an instruction to repair the abnormal application component acting as a system bottleneck in the distributed computing environment.

System and method for end-to-end application root cause recommendation

A method of identifying a root cause in a distributed computing environment includes traversing a plurality of nodes in a call graph starting with an end user node. Each node corresponds to an application component. A response time is calculated between connected pairs of neighboring nodes. A weight is calculated for each of a plurality of edges connecting the neighboring nodes. The nodes are traversed starting with the end user node in an order based on the weight of each of the edges. A root cause score is calculated for each node based on traversing all of the nodes in the order based on the weight of each of the edges. A ranked list is generated.

System and method for relationship based root cause recommendation

A method of operating a computer system including collecting, from the computer system, data indicative of variations in throughput and response time over a period of time, calculating processing power of the computer system over the period of time, recording a maximal power, calculating a standard deviation of the response time (RT-StdDev), recording the standard deviation of the response time corresponding to a time of the maximal power (RT-StdDevMaxPower), and generating a notification that the computer system is in a bottleneck state using a comparison of a current processing power to the maximal power and a comparison of the RT-StdDev to the RT-StdDevMaxPower.

Application abnormality detection

A method and a system for providing customizable, process-specific Just-In-Time debugging in operating system is provide in this invention. The method comprises the following steps: obtaining process-specific JIT debugging information, in response to the occurrence of an trap event in operating system; invoking the debugger corresponding to the process according to the obtained process-specific JIT debugging information. This method and system supports per-process JIT debugging configuration.

Providing customizable, process-specific just-in-time debugging in an operating system

A method and system for invoking Just-In-Time debugger is described, which can provide more efficient JIT debugging for complex code mixed applications. A method for invoking a Just-In-Time (JIT) debugger according to one embodiment includes checking a code type of a code address where a JIT debugging request is triggered from a process of a code-mixed application in response to the JIT debugging request from the process; acquiring corresponding JIT debugging information for different code types of the code-mixed application; and invoking a JIT debugger corresponding to the code type in response to the checked code type of the code address in the process and the acquired corresponding JIT debugging information.

Method and system for invoking just-in-time debugger

Dynamic help information is provided by receiving unit, configured to receive at least one operation of a user and to obtain the user's operation history, where the operation history includes at least one operation; a determining unit, configured to determine the corresponding help information according to the user's operation history; and an information obtaining unit, configured to obtain said corresponding help information. Assistance in providing help information is also provided, comprising: an operation capturing unit, configured to capture and send at least one operation of a user; and an information displaying unit, configured to receive and display the help information corresponding to the user's operation history, where the operation history includes at least one operation. With the apparatuses and method of this invention, the pertinent help information can be dynamically provided for users according to user's operation history.

Dynamic help information

Web services are automatically generated from corresponding Web applications under service-oriented architecture. A Web service is generated based on a Web application, comprising: obtaining user input information of the Web application, obtaining call stack information that is generated by the Web application at runtime based on the user input information, performing parameter matching between the user input information and the call stack information, selecting a method from the call stack information as an application programming interface based on a result of the parameter matching and the call stack information, and generating the Web service using the application programming interface.

Generating a web service

The present invention relates to a technology for deadlock detection in a program, and more particularly relates to a technology for detecting deadlock in a program through lock graph analysis. The present invention provides a method for detecting deadlock, comprising: obtaining lock information related to locking operation in a program; generating a first lock graph based on the obtained lock information, wherein each node in the first lock graph comprises a set of locks comprising at least one lock and a set of program locations comprising at least one lock location; extracting a strongly connected sub graph in the first lock graph; unfolding the strongly connected sub graph in the first lock graph to generate a second lock graph, wherein each node in the second lock graph comprises a single lock; and extracting a strongly connected sub graph in the second lock graph, the strongly connected sub graph in the second lock graph indicating a deadlock in the program.

Method and system for detecting program deadlock

A deadlock detection method and computer system for parallel programs. A determination is made that a lock of the parallel programs is no longer used in a running procedure of the parallel programs. A node corresponding to the lock that is no longer used, and edges relating to the lock that is no longer used, are deleted from a lock graph corresponding to the running procedure of the parallel programs in order to acquire an updated lock graph. The lock graph is constructed according to a lock operation of the parallel programs. Deadlock detection is then performed on the updated lock graph.

Deadlock detection for parallel programs

A method and system for facilitating runtime memory analysis. The method includes: assigning a unique ID for each task in a running program; recording memory access events occurring during the running program, including the IDs of the task performing the memory accesses; issuing a task termination notification in response to a task terminating, the task termination notification including the ID of the terminating task; and releasing all the memory access events having the ID of the terminating task in the memory, in response to the task termination notification. This method and system can ensure that the memory access events stored in the memory will not increase unlimitedly, so that the memory overhead is reduced remarkably and dynamic memory analysis can be faster and more efficient.

Facilitating memory analysis

A method and/or system for detecting deadlock, comprising: obtaining lock information related to locking operation in a program; generating a first lock graph based on the obtained lock information, wherein each node in the first lock graph comprises a set of locks comprising at least one lock and a set of program locations comprising at least one lock location; extracting a strongly connected sub graph in the first lock graph; unfolding the strongly connected sub graph in the first lock graph to generate a second lock graph, wherein each node in the second lock graph comprises a single lock; and extracting a strongly connected sub graph in the second lock graph, the strongly connected sub graph in the second lock graph indicating a deadlock in the program.

A method and system of deadlock detection in a parallel program, the method comprising: recording lock events during the operation of the parallel program and a first order relation among the lock events; converting information relevant to the operation of the parallel program into gate lock events and recording the gate lock events; establishing a second order relation among the gate lock events and lock events associated with the gate lock events and adding the second order relation to the first order relation; constructing a lock graph corresponding to the operation procedure of the parallel program based on the added first order relation; and performing deadlock detection on the constructed lock graph. The deadlock detection method of the invention can improve the accuracy of deadlock detection without depending on the deadlock detection algorithm per se, and can be applied with facility to various development environments and reduce development costs.

Deadlock detection in a parallel program

The present invention provides a method and system for processing memory access events. The method comprises: executing an extended program including instrumented memory tracking code for tracking memory access events of a plurality of objects; allocating a unique identifier for each of the plurality of tracked objects; creating a weak reference for each of the plurality of tracked objects, wherein a mapping relationship is established between the identifier of the weak reference and that of the corresponding tracked object; recording and storing the memory access events of the plurality of tracked objects; in response to receiving a notification of memory garbage collection which includes an identifier of a weak reference of a collected object, determining the identifier of the collected object based on the mapping relationship between the identifier of the weak reference and that of the corresponding tracked object, and searching the stored memory access events for the memory access events of the collected object; and deleting the memory access events of the collected object. The storage overhead may be reduced according to the above method of the present invention.

Method and system to space-efficiently track memory access of object-oriented language in presence of garbage collection

A method of accessing a shared data structure in parallel by multiple threads in a parallel application program is disclosed. A lock of the shared data structure is granted to one thread of the multiple threads, an operation of the thread which acquires the lock is performed on the shared data structure, an operation of each thread of the multiple threads which does not acquire the lock is buffered, and the buffered operations are performed on the shared data structure when another thread of the multiple threads subsequently acquires the lock. A corresponding apparatus and program product are also disclosed.

Method and apparatus for accessing a shared data structure in parallel by multiple threads

Methods and systems are provided for remotely deploying computer programs. Remote deployment is implemented by acquiring available resource information and related network resource information of a client in response to a request for remotely deploying a plurality of computer programs for the client; determining a deployment policy based on the available resource information and the related network resource information of the client; and remotely deploying transmission and installation of the plurality of computer programs based on the deployment policy.

Growing community of inventors

Beijing, China

Yao Dong Qi