-
公开(公告)号：US20200379876A1
公开(公告)日：2020-12-03
申请号：US16425480
申请日：2019-05-29
Applicant: Red Hat, Inc.
Inventor： Michel Peterson , Michael Kolesnik
IPC: G06F11/36
Abstract: Methods and systems for improved test execution and log file tracking are presented. In one embodiment, a method includes receiving a log file, which may be associated with a test. An original logging position of the log file may be stored and the test may be executed. Executing the test may cause logging information to be appended to the original logging position at the original logging position. An output file corresponding to the log file may be created and the original logging position within the log file may be located. A portion of the log file may then be copied to the output file starting at the original logging position.
-
公开(公告)号：US11347619B2
公开(公告)日：2022-05-31
申请号：US16529134
申请日：2019-08-01
Applicant: Red Hat, Inc.
Inventor： Michel Peterson , Michael Kolesnik
Abstract: Log record analysis based on log record templates is disclosed. A plurality of log records that comprise log data generated by one or more logging entities over a period of time is accessed. Each log record of the plurality of log records corresponds to one log record template of a plurality of different log record templates. The log records are analyzed to determine a particular log record template of the plurality of different log record templates to which a majority of the plurality of log records corresponds. An action is taken that is at least partially based on the particular log record template.
-
公开(公告)号：US20210042216A1
公开(公告)日：2021-02-11
申请号：US16533438
申请日：2019-08-06
Applicant: Red Hat, Inc.
Inventor： Nir Magnezi , Michel Peterson , Michael Kolesnik
Abstract: Problematic code changes that broke a software build can be identified. For example, a system can identify a broken software build and a last stable software-build associated with a software project, and generate a history of code commits associated with the software project based on commit logs from commit repositories. The code commits in the history were applied to the software project after the last stable software-build and before the broken software build. The system can then iteratively test the code commits in the history to determine a problematic code-commit that is at least partially responsible for the broken software build.
-
公开(公告)号：US11277336B2
公开(公告)日：2022-03-15
申请号：US15931150
申请日：2020-05-13
Applicant: Red Hat, Inc.
Inventor： Michel Peterson , Michael Kolesnik
Abstract: Methods and systems for communicating between nodes within computing clusters. In one embodiment, a method is provided that includes receiving, at a first node within a first cluster, a packet for transmission from a second node within the first cluster. The packet for transmission may be received via a local tunnel of the first cluster. A routing agent of the first node may identify a first destination address included within the packet for transmission and determine that the first destination address corresponds to a second cluster. The routing agent may also generate a second destination address corresponding to a third node of the second cluster and transmit the packet to the second destination address via an external tunnel between a plurality of clusters including the first cluster and the second cluster.
-
公开(公告)号：US11061808B2
公开(公告)日：2021-07-13
申请号：US16591815
申请日：2019-10-03
Applicant: Red Hat, Inc.
Inventor： Michel Peterson , Michael Kolesnik
Abstract: Some examples of the present disclosure relate to troubleshooting test failures that occurred during a testing phase of a continuous integration pipeline. In one particular example, a system can detect that an artifact failed the testing phase. The testing phase can involve each worker node in a plurality of worker nodes executing a respective group of tests on the artifact. Based on detecting that the artifact failed the testing phase, the system can determine a particular worker node that executed a test that failed during the testing phase. The system can then determine the respective group of tests that was executed by the particular worker node during the testing phase. The system can re-execute the respective group of tests on the artifact in accordance with troubleshooting rules to determine a reason that the test failed during the testing phase.
-
Patent Agency Ranking
公开(公告)号：US10990514B2
公开(公告)日：2021-04-27
申请号：US16533438
申请日：2019-08-06
Applicant: Red Hat, Inc.
Inventor： Nir Magnezi , Michel Peterson , Michael Kolesnik
Abstract: Problematic code changes that broke a software build can be identified. For example, a system can identify a broken software build and a last stable software-build associated with a software project, and generate a history of code commits associated with the software project based on commit logs from commit repositories. The code commits in the history were applied to the software project after the last stable software-build and before the broken software build. The system can then iteratively test the code commits in the history to determine a problematic code-commit that is at least partially responsible for the broken software build.
-
公开(公告)号：US20210089513A1
公开(公告)日：2021-03-25
申请号：US16583062
申请日：2019-09-25
Applicant: Red Hat, Inc.
Inventor： Michael Kolesnik , Michel Peterson
Abstract: An apparatus and method of performing a time-based operation on a row in a database table includes receiving a function to be applied to a particular row in a table within the database management system. The method may also include, in response to receiving the function, adding a new column to the table. A new cell in the new column includes a timer indicating a time that the processing device will call the function, and the new cell references the function. The method may also include, upon expiration of the timer, determining that the database management system is available for execution of the function, and executing the function on the particular row in the table.
-
公开(公告)号：US20230161753A1
公开(公告)日：2023-05-25
申请号：US18094481
申请日：2023-01-09
Applicant: Red Hat, Inc.
Inventor： Michael Kolesnik , Michel Peterson
CPC classification number: G06F16/2365 , G06F16/221 , G06F16/2282 , G06F16/2358
Abstract: An apparatus and method of performing a time-based operation on a row in a database table includes receiving a function to be applied to a particular row in a table within the database management system. The method may also include, in response to receiving the function, adding a new column to the table. A new cell in the new column includes a timer indicating a time that the processing device will call the function, and the new cell references the function. The method may also include, upon expiration of the timer, determining that the database management system is available for execution of the function, and executing the function on the particular row in the table.
-
公开(公告)号：US11550775B2
公开(公告)日：2023-01-10
申请号：US16583062
申请日：2019-09-25
Applicant: Red Hat, Inc.
Inventor： Michael Kolesnik , Michel Peterson
Abstract: An apparatus and method of performing a time-based operation on a row in a database table includes receiving a function to be applied to a particular row in a table within the database management system. The method may also include, in response to receiving the function, adding a new column to the table. A new cell in the new column includes a timer indicating a time that the processing device will call the function, and the new cell references the function. The method may also include, upon expiration of the timer, determining that the database management system is available for execution of the function, and executing the function on the particular row in the table.
-
公开(公告)号：US20210359935A1
公开(公告)日：2021-11-18
申请号：US15931150
申请日：2020-05-13
Applicant: Red Hat, Inc.
Inventor： Michel Peterson , Michael Kolesnik
IPC: H04L12/715 , H04L12/721 , H04L12/46 , H04L29/08 , H04L29/12
Abstract: Methods and systems for communicating between nodes within computing clusters. In one embodiment, a method is provided that includes receiving, at a first node within a first cluster, a packet for transmission from a second node within the first cluster. The packet for transmission may be received via a local tunnel of the first cluster. A routing agent of the first node may identify a first destination address included within the packet for transmission and determine that the first destination address corresponds to a second cluster. The routing agent may also generate a second destination address corresponding to a third node of the second cluster and transmit the packet to the second destination address via an external tunnel between a plurality of clusters including the first cluster and the second cluster.
-
-
-
-
-
-
-
-
-
Search Results
14
records
(took 0.023 seconds)
