DETERMINING CHARACTERISTICS OF CONFIGURATION FILES
    42.
    发明申请
    DETERMINING CHARACTERISTICS OF CONFIGURATION FILES 审中-公开
    确定配置文件的特性

    公开(公告)号:US20150379034A1

    公开(公告)日:2015-12-31

    申请号:US14735478

    申请日:2015-06-10

    CPC classification number: G06F9/44505

    Abstract: Determining a characteristic of a configuration file that is used to discover configuration files in a target machine, a computer identifies, using information associated with a configuration item of a machine, a candidate configuration file related to the configuration item of the machine, from among a plurality of files from the machine. The computer extracts a value of a feature of the candidate configuration file and aggregates the candidate configuration file with a second candidate configuration file related to the same configuration item identified from among a plurality of files from a second machine, based on the extracted value. The computer then determines a configuration file related to the configuration item from among the aggregated candidate configuration files based on a result of the aggregation, and determines a characteristic of the configuration file related to the configuration item.

    Abstract translation: 确定用于发现目标机器中的配置文件的配置文件的特性,计算机使用与机器的配置项相关联的信息来识别与机器的配置项相关的候选配置文件, 来自机器的多个文件。 计算机提取候选配置文件的特征值,并基于提取的值,从第二机器聚合候选配置文件与从与多个文件中识别的相同配置项目相关的第二候选配置文件。 然后,计算机根据聚合结果从聚合候选配置文件中确定与配置项相关的配置文件,并确定与配置项相关的配置文件的特性。

    Distributed Computing Topology with Energy Savings

    公开(公告)号:US20240231906A1

    公开(公告)日:2024-07-11

    申请号:US18150397

    申请日:2023-01-05

    CPC classification number: G06F9/4893 G06F9/3838

    Abstract: A computer implemented method manages a topology for a network computing system. A number of processor units determines tasks for a workload to be performed by computing devices in the network computing system. The number of processor units creates the topology for performing the tasks in the workload. The topology comprises nodes representing the tasks assigned to the computing devices. The nodes are connected to each other based on an execution order for the tasks, and the topology has alternative paths for performing the tasks for the workload. The number of processor units determines energy consumption for the alternative paths in the topology. The number of processor units selects a particular path from the alternative paths for performing the tasks for the workload based on the energy consumption for the alternative paths.

    Event management in computer system

    公开(公告)号:US11762894B2

    公开(公告)日:2023-09-19

    申请号:US17456653

    申请日:2021-11-29

    CPC classification number: G06F16/35 G06F40/211 G06F40/30

    Abstract: Embodiments of the present invention relate to methods, systems, and computer program products for event management. In a method, a plurality of notes that are comprised in a plurality of event records are obtained in a computer system. A plurality of paragraphs that are comprised in the plurality of notes are classified into a plurality of content types based on a content analysis of the plurality of paragraphs. The plurality of notes are classified into a plurality of semantic types based on the plurality of content types and a syntactic parsing to the plurality of notes. A knowledge item is generated for managing an event in the computer system based on a group of notes in the plurality of notes that are classified into the plurality of semantic types. With these embodiments, knowledge items for managing events may be obtained in an easier and more effective way.

    DYNAMIC GRAPHING FOR MANAGING AN IT OPERATION SYSTEM

    公开(公告)号:US20220182294A1

    公开(公告)日:2022-06-09

    申请号:US17247347

    申请日:2020-12-08

    Abstract: A method, computer system, and a computer program product are provided for dynamic viewing of an operation graph depicting a distributed workload in an Information Technology system. A list may be received as input and may include selected nodes. A sub-graph may be abstracted from a global graph. The sub-graph and the global graph may depict interactions among ops objects of the distributed workload using nodes and edges. First nodes may be removed from the global graph according to the list. Direct edges between remaining nodes from the global graph may be maintained. A first indirect edge may be generated based on the removed first nodes. The first indirect edge may run between a first remaining node and a second remaining node. The sub-graph may be presented removed from the global graph.

Patent Agency Ranking