International Business Machines Corporation

Alibaba Group Holding Limited

Samsung Electronics Co., Ltd.

Lenovo (beijing) Limited

Bo Chen Zhu

Peng Fei Tian

Cheng Fang Wang

Tian Ming Pan

Chu Yun Tong

Peng Hui Jiang

Xu Bin Liu

Yan Bin Hu

Zhengxiong Tian

Ai Ping Feng

Junjie Cai

Haihong Xu

Xinzhe Wang

Jing Wang

Wei Li

Al Chakra

Hui Wang

Xiao Ling Chen

Peng Wang

Jun Su

Yu Ying Wang

Jun Jiang

Jing Yan Ma

Fan Zhang

Yuan Yuan Zhang

Mai Zeng

Xi Bo Zhu

Yu Mei Dai

Zhaohui Ding

Zhiyuan Duan

Wei Wen

Jun Song

Da Xu

Yi Xin Song

Xiao Chen Huang

Kai Huang

Kangkang Chen

Yu Zhuang

Xiang Yu Xue

Fu Li Bian

Ren Fu Ma

Yan Ting Li

Bing Qian

Guangfeng Yao

Aihua Tao

Hui R Ruan

Xiao Mou Zhang

Dan Hui Fan

Linquan Jiang

Hong Yan Gu

An approach for recommending an application of a software code update. The approach receives components of an executable program. The approach scans the components to divide the executable program into units. The approach creates a logical layer of entry lists, based on the units, for instantiations of the executable program. The approach loads the instantiations of the executable program based on the logical layers. The approach monitors the execution of the instantiations to increment counters based on executions of the units. The approach creates a heatmap of the executions based on the counters. The approach generates a recommendation to update the executable based on the heatmap.

Program code update recommendation based on a heatmap

A method, computer system, and a computer program product are provided for managing an accelerated shutdown of a networked system having a having a plurality of nodes. The system to be shutdown is analyzed and a priority order is determined for the nodes. An interval period is also determined between each node according to the priority order. A leaf node set is constructed according to different shutdown types required for each node and a dependency tree is constructed by analyzing the leaf node sets. Each node is then shutdown according to the tree and the interval period determined. The dependency tree and the interval period is iteratively modified during the node shutdown until all nodes and ultimately the system shutdown has been completed.

Techniques for shutdown acceleration

A method and an apparatus for scheduling a virtual machine are disclosed in. The method includes predicting resource data required by a virtual machine in a next time period to obtain a prediction result; obtaining used resource data and available resource data of candidate host machines; adding the prediction result to used resource data of each candidate host machine to obtain a superimposition result of each candidate host machine; and separately comparing the superimposition result of each candidate host machine with available resource data of each host machine, and selecting a target host machine corresponding to the virtual machine from the candidate host machines. The present disclosure solves the technical problem of a large waste of resources caused by the needs of a host machine to reserve resources for respective peaks of each virtual machine in the existing technologies.

Virtual machine scheduling method and apparatus

Embodiments of the present invention provide computer-implemented methods, computer program products and computer systems. Embodiments of the present invention can, in response to receiving performance data associated with records, identify whether the received performance data is associated with long transactions. Embodiments of the present invention can then, in response to determining that the received performance data is associated with long transactions, storing the performance data. Embodiments of the present invention can then classify the stored performance data according to types of transactions the performance data and aggregate the stored performance data based on the classification.

Dynamic data aggregation

A method, computer system, and computer program product for data monitoring management are provided. A first invalid zero value candidate from a data stream is received. A memory location for the first invalid zero value candidate is received. At a first time an access connection to the memory location is established. At a second time subsequent to the first time the access connection to the memory location is checked. Based on the checking, a determination is made whether the first invalid zero value candidate contains an invalid zero value.

Correcting invalid zero value for data monitoring

A method and a system for scheduling a virtual machine are disclosed. The method includes: obtaining energy consumption data of a rack and energy consumption data of host computers, wherein the rack is used to place the host computers; determining power consumption data of a virtual machine; determining a target host computer corresponding to the virtual machine according to the energy consumption data of the rack, the energy consumption data of the host computers, and the power consumption data of the virtual machine; and dispatching the virtual machine to the target host computer. The present disclosure solves the technical problems of unbalanced power consumption scheduling caused by virtual machine scheduling methods that are implemented only according to CPU parameters in the existing technologies.

Virtual machine scheduling method and system

Aspects of the invention include a computer-implemented method by executing, via a processor, a bottleneck model training process for microservices in a microservice system, wherein for each of the microservices the bottleneck model training process filters out a subset of training data based at least in part on a current situation setting. Building, via the processor, a bottleneck indicator model for each of the microservices using information from the bottleneck model training process, convergence points for an expected response time. Executing, via the processor, a bottleneck identification process for providing system alerts when a bottleneck is identified, wherein the bottleneck identification process uses analysis to monitor a data stream according to the bottleneck indicator model which uses the convergence points for response times.

Enhanced bottleneck analysis at an early stage in a microservice system

Computer-implemented methods, computer program products, and computer systems are provided. A method includes generating a running result matrix for a plurality of batch jobs, indicating corresponding running results for respective processing actions in batch jobs of the plurality of batch jobs. The method further includes obtaining an internal dependency matrix for the plurality of batch jobs, indicating corresponding dependencies between respective processing actions within a batch job of the plurality of batch jobs. The method further includes calculating a recovery matrix for the plurality of batch jobs based, at least in part, on the running result matrix and the internal dependency matrix, the recovery matrix indicating corresponding recovery actions for respective processing actions in batch jobs of the plurality of batch jobs. The method further includes executing failover management for one or more batch jobs based, at least in part, on the calculated recovery matrix.

Failover management for batch jobs

In an approach, a processor obtains a first set of training samples, one of the training samples including values of a plurality of performance indicators of a target system observed at a historical point in time. A processor determines whether the first set of training samples are qualified for training a prediction model, the prediction model predicting an operational status of the target system at a target point in time based on values of the plurality of performance indicators observed at the target point in time. A processor, in response to determining that the first set of training samples are qualified for training the prediction model, trains, the prediction model based on the first set of training samples.

Predicting operational status of system

The present disclosure provides an electronic device. The electronic device includes a body and a display screen. The display screen is fixed to the body. A back of the body includes a spacing area not covered by the display screen, the spacing area including a conductor layer. The electronic device further includes an antenna of the electronic device disposed in the spacing area to emit or receive radio frequency signals. The antenna includes the conductor layer.

Electronic device

An approach is provided in which a set of provision information is generated from a set of provisioners that are in process of fulfilling a client's provision request. The approach creates a set of provision events based on the set of provision information and, in response to detecting a failure of the provision request, the approach generates a provision chain from the set of provision events. The provision chain links the set of provision events based on correlation rules and identifies at least one isolation point of the failure. The approach informs the client of the at least one isolation point of the failure identified in the provision chain.

Cognitive problem isolation in quick provision fault analysis

Embodiments include cognitive control of runtime resource monitoring scope. Aspects include obtaining historical data for each of a plurality of metrics for a computer system and calculating, based on the historical data, an anomaly relationship score for each of the plurality of metrics. Aspects also include calculating, based on the historical data, a sensitivity score for each of the plurality of metrics and determining a priority score for each of the plurality of metrics based upon a weighted combination of the anomaly relationship score and the priority score. Aspects further include receiving real-time data for each of the plurality of metrics and presenting a subset of the real-time data to a user, the subset created by selecting one or more of the plurality of metrics based on the priority score of each of the plurality of metrics.

Cognitive control of runtime resource monitoring scope

Aspects of the invention include detecting and predicting application performance. A non-limiting example computer-implemented method includes receiving source code and generating a first model of the source code by labeling a word of the source code. The computer implemented method optimizes the first model of the source code by assembling the first model of the source code with a plurality of models generated by a model generation module into a second model of the source code and extracts at least two basic features from the second model of the source code. The computer-implemented method provides an estimated performance of the source code based on historical data of the basic features extracted from the second model of the source code.

Detecting and predicting application performance

In an approach for maintaining data synchronization, a processor scans a set of data fields at each stage of a data analysis process. A processor generates a relationship tree model, wherein the set of data fields each correspond to a node in the relationship tree model. A processor prunes the relationship tree model. Responsive to an update to a data field of the set of data fields, a processor promulgates the update using the relationship tree model to generate an updated set of insight data. A processor outputs the updated set of insight data.

Maintaining synchronization of collected data and insights

Techniques for data storage strategy determination are described herein. An aspect includes determining a plurality of file classifications for files that are stored in a data storage system based on performance history data of a disaster recovery (DR) system of the data storage system. Another aspect includes determining classification records and performance records for the DR system based on the plurality of file classifications. Another aspect includes determining an information loss based on the performance records. Another aspect includes determining a total cost savings based on the classification records. Another aspect includes determining a recommended recovery time objective (RTO)/recovery point objective (RPO) strategy based on the information loss and the total cost savings. Another aspect includes implementing the recommended RTO/RPO strategy in the DR system.

Data storage strategy determination

Growing community of inventors

Xi'an, China

Bo Chen Zhu