Patents by Inventor Jose N. Amaral

Jose N. Amaral 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: 11188348
    Abstract: Methods, systems, and computer program products for hardware device selection in a computing environment are provided. Aspects include receiving, by a processor, a request to execute a programming code, wherein the processor is operating in a hybrid computing environment comprising a plurality of hardware devices. A performance model associated with the programming code is obtained by the processor. Runtime data associated with the programming code is obtained by the processor. The runtime data is fed in to the performance model to determine an execution cost for executing the programming code on each of the plurality of hardware devices and a target hardware device is selected from the plurality of hardware devices based on the execution costs.
    Type: Grant
    Filed: August 31, 2018
    Date of Patent: November 30, 2021
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Artem Chikin, Ettore Tiotto, Jose N. Amaral, Karim Ali
  • Patent number: 11070230
    Abstract: A method, computer system, and a computer program product for high-speed data compression is provided. The present invention may include receiving an input stream. The present invention may include selecting a header based on the received input stream, wherein the header includes a base, a scheme and a delta count. The present invention may include determining whether there are any remaining values in an uncompressed input stream. The present invention may include reading a first next value from the input stream. The present invention may include determining whether the read first next value is representable with a current base scheme. The present invention may include calculating the delta count based on determining that the read first next value is representable with the current base scheme. The present invention may include writing the calculated delta count to the selected header. The present invention may include incrementing the written delta count.
    Type: Grant
    Filed: July 25, 2019
    Date of Patent: July 20, 2021
    Assignee: International Business Machines Corporation
    Inventors: Jose N. Amaral, Christopher M. Barton, Taylor J. Lloyd, Ettore Tiotto
  • Publication number: 20200073677
    Abstract: Methods, systems, and computer program products for hardware device selection in a computing environment are provided. Aspects include receiving, by a processor, a request to execute a programming code, wherein the processor is operating in a hybrid computing environment comprising a plurality of hardware devices. A performance model associated with the programming code is obtained by the processor. Runtime data associated with the programming code is obtained by the processor. The runtime data is fed in to the performance model to determine an execution cost for executing the programming code on each of the plurality of hardware devices and a target hardware device is selected from the plurality of hardware devices based on the execution costs.
    Type: Application
    Filed: August 31, 2018
    Publication date: March 5, 2020
    Inventors: Artem Chikin, Ettore Tiotto, Jose N. Amaral, Karim Ali
  • Patent number: 10558441
    Abstract: Embodiments of the present invention facilitate pruning a dependence graph for a loop in a computer program. An example computer-implemented method includes determining, by a compiler, a source and a sink of a dependence in the dependence graph. The method further includes determining, by the compiler, a source symbolic expression for the source, and a sink symbolic expression for the sink. The method further includes constructing, by the compiler, a difference expression using the source symbolic expression and the sink symbolic expression. The method further includes checking, by the compiler, if the difference expression is indicative of a memory overlap between the source and the sink. The method further includes, in response to the difference expression being indicative of no overlap, removing the dependence from the dependence graph, and generating object code for the computer program based on the dependence graph.
    Type: Grant
    Filed: March 12, 2018
    Date of Patent: February 11, 2020
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Ettore Tiotto, Jose N. Amaral, Artem Chikin, Taylor Lloyd
  • Publication number: 20190349000
    Abstract: A method, computer system, and a computer program product for high-speed data compression is provided. The present invention may include receiving an input stream. The present invention may include selecting a header based on the received input stream, wherein the header includes a base, a scheme and a delta count. The present invention may include determining whether there are any remaining values in an uncompressed input stream. The present invention may include reading a first next value from the input stream. The present invention may include determining whether the read first next value is representable with a current base scheme. The present invention may include calculating the delta count based on determining that the read first next value is representable with the current base scheme. The present invention may include writing the calculated delta count to the selected header. The present invention may include incrementing the written delta count.
    Type: Application
    Filed: July 25, 2019
    Publication date: November 14, 2019
    Inventors: Jose N. Amaral, Christopher M. Barton, Taylor J. Lloyd, Ettore Tiotto
  • Patent number: 10419022
    Abstract: A method, computer system, and a computer program product for high-speed data compression is provided. The present invention may include receiving an input stream. The present invention may include selecting a header based on the received input stream, wherein the header includes a base, a scheme and a delta count. The present invention may include determining whether there are any remaining values in an uncompressed input stream. The present invention may include reading a first next value from the input stream. The present invention may include determining whether the read first next value is representable with a current base scheme. The present invention may include calculating the delta count based on determining that the read first next value is representable with the current base scheme. The present invention may include writing the calculated delta count to the selected header. The present invention may include incrementing the written delta count.
    Type: Grant
    Filed: November 30, 2017
    Date of Patent: September 17, 2019
    Assignee: International Business Machines Corporation
    Inventors: Jose N. Amaral, Christopher M. Barton, Taylor J. Lloyd, Ettore Tiotto
  • Publication number: 20190278575
    Abstract: Embodiments of the present invention facilitate pruning a dependence graph for a loop in a computer program. An example computer-implemented method includes determining, by a compiler, a source and a sink of a dependence in the dependence graph. The method further includes determining, by the compiler, a source symbolic expression for the source, and a sink symbolic expression for the sink. The method further includes constructing, by the compiler, a difference expression using the source symbolic expression and the sink symbolic expression. The method further includes checking, by the compiler, if the difference expression is indicative of a memory overlap between the source and the sink. The method further includes, in response to the difference expression being indicative of no overlap, removing the dependence from the dependence graph, and generating object code for the computer program based on the dependence graph.
    Type: Application
    Filed: March 12, 2018
    Publication date: September 12, 2019
    Inventors: Ettore Tiotto, Jose N. Amaral, Artem Chikin, Taylor Lloyd
  • Publication number: 20190165804
    Abstract: A method, computer system, and a computer program product for high-speed data compression is provided. The present invention may include receiving an input stream. The present invention may include selecting a header based on the received input stream, wherein the header includes a base, a scheme and a delta count. The present invention may include determining whether there are any remaining values in an uncompressed input stream. The present invention may include reading a first next value from the input stream. The present invention may include determining whether the read first next value is representable with a current base scheme. The present invention may include calculating the delta count based on determining that the read first next value is representable with the current base scheme. The present invention may include writing the calculated delta count to the selected header. The present invention may include incrementing the written delta count.
    Type: Application
    Filed: November 30, 2017
    Publication date: May 30, 2019
    Inventors: Jose N. Amaral, Christopher M. Barton, Taylor J. Lloyd, Ettore Tiotto
  • Patent number: 9111032
    Abstract: Embodiments are directed to identifying, by an apparatus comprising a processing device, a pattern in a graph that has a support value greater than a threshold, wherein: the graph comprises a plurality of weighted nodes coupled to one another by one or more weighted edges, and each of the plurality of nodes is associated with at least one weighted attribute.
    Type: Grant
    Filed: March 18, 2014
    Date of Patent: August 18, 2015
    Assignee: International Business Machines Corporation
    Inventors: Jose N. Amaral, Li Ding, Carolina Gomes, Joran S. C. Siu
  • Patent number: 9003373
    Abstract: Embodiments are directed to identifying, by an apparatus comprising a processing device, a pattern in a graph that has a support value greater than a threshold, wherein: the graph comprises a plurality of weighted nodes coupled to one another by one or more weighted edges, and each of the plurality of nodes is associated with at least one weighted attribute.
    Type: Grant
    Filed: January 2, 2013
    Date of Patent: April 7, 2015
    Assignee: International Business Machines Corporation
    Inventors: Jose N. Amaral, Li Ding, Carolina Simoes Gomes, Joran S. C. Siu
  • Publication number: 20140201722
    Abstract: Embodiments are directed to identifying, by an apparatus comprising a processing device, a pattern in a graph that has a support value greater than a threshold, wherein: the graph comprises a plurality of weighted nodes coupled to one another by one or more weighted edges, and each of the plurality of nodes is associated with at least one weighted attribute.
    Type: Application
    Filed: March 18, 2014
    Publication date: July 17, 2014
    Applicant: International Business Machines Corporation
    Inventors: Jose N. Amaral, Li Ding, Carolina Gomes, Joran S. C. Siu
  • Publication number: 20140189655
    Abstract: Embodiments are directed to identifying, by an apparatus comprising a processing device, a pattern in a graph that has a support value greater than a threshold, wherein: the graph comprises a plurality of weighted nodes coupled to one another by one or more weighted edges, and each of the plurality of nodes is associated with at least one weighted attribute.
    Type: Application
    Filed: January 2, 2013
    Publication date: July 3, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Jose N. Amaral, Li Ding, Carolina Simoes Gomes, Joran S.C. Siu