Patents by Inventor Michel Peterson
Michel Peterson has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 11637812Abstract: Methods for dynamic forward proxy chaining are performed by systems and devices. A forward proxy server receives an electronic communication message that includes destination information in a header and payload information. Destination information includes an ordered set of subsequent destination identifiers associated with subsequent forward proxy servers and an ultimate destination identifier for the electronic communication message. The destination information in the electronic communication message is modified by the forward proxy server to generate a modified electronic communication message. Based on proxy operations performed by the forward proxy server, destination information is modified by removing destinations, adding destinations, altering ports for destinations, and other modifications.Type: GrantFiled: October 13, 2020Date of Patent: April 25, 2023Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Guy Lewin, Michel Peterson
-
Patent number: 11550775Abstract: 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.Type: GrantFiled: September 25, 2019Date of Patent: January 10, 2023Assignee: Red Hat, Inc.Inventors: Michael Kolesnik, Michel Peterson
-
Patent number: 11429637Abstract: Techniques are described herein that are capable of providing offline support for a database cluster that includes online nodes and an offline-compatible node. For example, an operation may be performed with regard to information, which is stored by the offline-compatible node while the offline-compatible node is not connected to the online nodes via the network, based at least in part on the offline-compatible node being connected to the online nodes. In another example, an operation may be performed with regard to information, which is stored by any one or more of the online nodes while the offline-compatible node is not connected to the online nodes via the network, based at least in part on the offline-compatible node being connected to the online nodes.Type: GrantFiled: October 13, 2020Date of Patent: August 30, 2022Assignee: Microsoft Technology Licensing, LLCInventors: Michel Peterson, Guy Lewin
-
Patent number: 11347619Abstract: 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.Type: GrantFiled: August 1, 2019Date of Patent: May 31, 2022Assignee: Red Hat, Inc.Inventors: Michel Peterson, Michael Kolesnik
-
Publication number: 20220114191Abstract: Techniques are described herein that are capable of providing offline support for a database cluster that includes online nodes and an offline-compatible node. For example, an operation may be performed with regard to information, which is stored by the offline-compatible node while the offline-compatible node is not connected to the online nodes via the network, based at least in part on the offline-compatible node being connected to the online nodes. In another example, an operation may be performed with regard to information, which is stored by any one or more of the online nodes while the offline-compatible node is not connected to the online nodes via the network, based at least in part on the offline-compatible node being connected to the online nodes.Type: ApplicationFiled: October 13, 2020Publication date: April 14, 2022Inventors: Michel Peterson, Guy Lewin
-
Publication number: 20220116361Abstract: Methods for dynamic forward proxy chaining are performed by systems and devices. A forward proxy server receives an electronic communication message that includes destination information in a header and payload information. Destination information includes an ordered set of subsequent destination identifiers associated with subsequent forward proxy servers and an ultimate destination identifier for the electronic communication message. The destination information in the electronic communication message is modified by the forward proxy server to generate a modified electronic communication message. Based on proxy operations performed by the forward proxy server, destination information is modified by removing destinations, adding destinations, altering ports for destinations, and other modifications.Type: ApplicationFiled: October 13, 2020Publication date: April 14, 2022Inventors: Guy LEWIN, Michel PETERSON
-
Patent number: 11277336Abstract: 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.Type: GrantFiled: May 13, 2020Date of Patent: March 15, 2022Assignee: Red Hat, Inc.Inventors: Michel Peterson, Michael Kolesnik
-
Patent number: 11275659Abstract: A system includes a memory and a processor in communication with the memory. The processor builds a preliminary history list of a plurality of commits including intermediary commits and a target commit, instantiates a target file list of files modified by the target commit, and instantiates an intermediary file list for each intermediary commit. Additionally, the processor classifies each intermediary commit as an intersecting commit or an empty commit. Responsive to classifying a respective intermediary commit as an empty commit, the processor removes the respective intermediary commit from the preliminary history list to create a candidate history list. Responsive to classifying a respective intermediary commit as an intersecting commit, the processor retains the respective intermediary commit in the candidate history list. Additionally, the processor joins the respective intermediary file list with the target file list and creates a finalized history list.Type: GrantFiled: February 12, 2019Date of Patent: March 15, 2022Assignee: Red Hat Israel, Ltd.Inventors: Michael Kolesnik, Michel Peterson
-
Publication number: 20210359935Abstract: 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.Type: ApplicationFiled: May 13, 2020Publication date: November 18, 2021Inventors: Michel Peterson, Michael Kolesnik
-
Patent number: 11061809Abstract: 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.Type: GrantFiled: May 29, 2019Date of Patent: July 13, 2021Assignee: Red Hat, Inc.Inventors: Michel Peterson, Michael Kolesnik
-
Patent number: 11061808Abstract: 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.Type: GrantFiled: October 3, 2019Date of Patent: July 13, 2021Assignee: Red Hat, Inc.Inventors: Michel Peterson, Michael Kolesnik
-
Patent number: 10990514Abstract: 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.Type: GrantFiled: August 6, 2019Date of Patent: April 27, 2021Assignee: Red Hat, Inc.Inventors: Nir Magnezi, Michel Peterson, Michael Kolesnik
-
Publication number: 20210103512Abstract: 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.Type: ApplicationFiled: October 3, 2019Publication date: April 8, 2021Inventors: Michel Peterson, Michael Kolesnik
-
Publication number: 20210089513Abstract: 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.Type: ApplicationFiled: September 25, 2019Publication date: March 25, 2021Inventors: Michael Kolesnik, Michel Peterson
-
Publication number: 20210042216Abstract: 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.Type: ApplicationFiled: August 6, 2019Publication date: February 11, 2021Inventors: Nir Magnezi, Michel Peterson, Michael Kolesnik
-
Publication number: 20210034497Abstract: 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.Type: ApplicationFiled: August 1, 2019Publication date: February 4, 2021Inventors: Michel Peterson, Michael Kolesnik
-
Publication number: 20200379876Abstract: 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.Type: ApplicationFiled: May 29, 2019Publication date: December 3, 2020Inventors: Michel Peterson, Michael Kolesnik
-
Publication number: 20200257597Abstract: A system includes a memory and a processor in communication with the memory. The processor builds a preliminary history list of a plurality of commits including intermediary commits and a target commit, instantiates a target file list of files modified by the target commit, and instantiates an intermediary file list for each intermediary commit. Additionally, the processor classifies each intermediary commit as an intersecting commit or an empty commit. Responsive to classifying a respective intermediary commit as an empty commit, the processor removes the respective intermediary commit from the preliminary history list to create a candidate history list. Responsive to classifying a respective intermediary commit as an intersecting commit, the processor retains the respective intermediary commit in the candidate history list. Additionally, the processor joins the respective intermediary file list with the target file list and creates a finalized history list.Type: ApplicationFiled: February 12, 2019Publication date: August 13, 2020Inventors: Michael Kolesnik, Michel Peterson