中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

42 records (took 0.017 seconds)

    MANAGEMENT OF NON-UNIVERSAL AND UNIVERSAL ENCODERS
    31.
    发明申请
    MANAGEMENT OF NON-UNIVERSAL AND UNIVERSAL ENCODERS 审中-公开

    公开(公告)号：US20190179572A1

    公开(公告)日：2019-06-13

    申请号：US15834133

    申请日：2017-12-07

    Applicant: International Business Machines Corporation

    Inventor： Jonathan Bradbury ,  Matthias Klein ,  Ashutosh Misra ,  Anthony Sofia

    IPC: G06F3/06

    Abstract: A system and method to manage a non-universal encoder and a universal encoder for compression of data include receiving the data. The data includes symbols. The method also includes subdividing the data into a first set of data blocks and a second set of data blocks and generating a non-universal encoder using the first set of data blocks. The non-universal encoder includes first codes. Each of the first codes corresponds to one of the symbols in the first set of data blocks only and at least one of the first codes includes fewer bits than the symbol corresponding to the at least one of the first codes. The method further includes compressing the second set of data blocks using at least the non-universal encoder.

    AGE MANAGEMENT LOGIC
    33.
    发明申请
    AGE MANAGEMENT LOGIC 审中-公开

    公开(公告)号：US20170168824A1

    公开(公告)日：2017-06-15

    申请号：US14967902

    申请日：2015-12-14

    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION

    Inventor： James J. Bonanno ,  Ashutosh Misra ,  Anthony Saporito

    IPC: G06F9/30

    CPC classification number: G06F9/3838 ,  G06F9/3842 ,  G06F9/3844 ,  G06F9/3855

    Abstract: A system, method and computer program product for maintaining an age and validity of entries in a structure associated with a processor is disclosed. An age tracking matrix is created for the structure. Each row of the age tracking matrix corresponds to an entry of the structure and each column of the age tracking matrix corresponds to an entry of the structure. When initiating an entry: a row corresponding to the entry is determined and a field in the determined row that is on a diagonal of the matrix is marked. For each other field in the determined row, the values that are in a diagonal field that is in a same column of the field are copied into the field. A relative age of the entries is determined by counting a number of marked fields in a column of the age tracking matrix.

    Variable updates of branch prediction states
    34.
    发明授权
    Variable updates of branch prediction states 有权
    分支预测状态的可变更新

    公开(公告)号：US09513909B2

    公开(公告)日：2016-12-06

    申请号：US15073685

    申请日：2016-03-18

    Applicant: International Business Machines Corporation

    Inventor： Narasimha R. Adiga ,  James J. Bonanno ,  Ashutosh Misra ,  Anthony Saporito

    IPC: G06F9/30 ,  G06F9/38

    CPC classification number: G06F9/3806 ,  G06F9/30058 ,  G06F9/30061 ,  G06F9/30145 ,  G06F9/3844 ,  G06F9/3848

    Abstract: Embodiments relate to variable branch prediction. An aspect includes determining a branch selection of an execution unit of a processor and determining whether a present prediction state of the state machine correctly predicted the branch selection by the execution unit. The aspect includes determining whether a predetermined condition is met for performing an alternative state transition and, based on determining that the predetermined condition is met, changing the present prediction state of the branch prediction state machine from the one state to another state according to an alternative state transition process based on the branch selection of the execution unit and the determination whether the present prediction state of the state machine correctly predicted the branch selection by the execution unit.

    Abstract translation: 实施例涉及可变分支预测。 一方面包括确定处理器的执行单元的分支选择，并确定状态机的当前预测状态是否正确地预测了执行单元的分支选择。 该方面包括确定是否满足用于执行替代状态转换的预定条件，并且基于确定满足预定条件，根据替代方案将分支预测状态机的当前预测状态从一种状态改变到另一状态 基于执行单元的分支选择的状态转换处理，以及确定状态机的当前预测状态是否正确地预测了执行单元的分支选择。

    VARIABLE UPDATES OF BRANCH PREDICTION STATES
    35.
    发明申请
    VARIABLE UPDATES OF BRANCH PREDICTION STATES 有权
    分支预测状态的可变更新

    公开(公告)号：US20150286483A1

    公开(公告)日：2015-10-08

    申请号：US14247813

    申请日：2014-04-08

    Applicant: International Business Machines Corporation

    Inventor： Narasimha R. Adiga ,  James J. Bonanno ,  Ashutosh Misra ,  Anthony Saporito

    IPC: G06F9/38 ,  G06F9/30

    CPC classification number: G06F9/3806 ,  G06F9/30058 ,  G06F9/30061 ,  G06F9/30145 ,  G06F9/3844 ,  G06F9/3848

    Abstract: Embodiments relate to variable branch prediction. An aspect includes determining a branch selection of an execution unit of a processor and determining whether a present prediction state of the state machine correctly predicted the branch selection by the execution unit. The aspect includes determining whether a predetermined condition is met for performing an alternative state transition and, based on determining that the predetermined condition is met, changing the present prediction state of the branch prediction state machine from the one state to another state according to an alternative state transition process based on the branch selection of the execution unit and the determination whether the present prediction state of the state machine correctly predicted the branch selection by the execution unit.

    Abstract translation: 实施例涉及可变分支预测。 一方面包括确定处理器的执行单元的分支选择，并确定状态机的当前预测状态是否正确地预测了执行单元的分支选择。 该方面包括确定是否满足用于执行替代状态转换的预定条件，并且基于确定满足预定条件，根据替代方案将分支预测状态机的当前预测状态从一种状态改变到另一状态 基于执行单元的分支选择的状态转换处理，以及确定状态机的当前预测状态是否正确地预测了执行单元的分支选择。

    RECORD-BASED MATCHING IN DATA COMPRESSION
    36.
    发明申请
    RECORD-BASED MATCHING IN DATA COMPRESSION 有权

    公开(公告)号：US20210255999A1

    公开(公告)日：2021-08-19

    申请号：US16793113

    申请日：2020-02-18

    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION

    Inventor： Matthias Klein ,  Damir Anthony Jamsek ,  Bulent Abali ,  Ashutosh Misra ,  Preetham M. Lobo

    IPC: G06F16/21 ,  G06F16/22

    Abstract: Compression of data is facilitated by locating matches within the data to be compressed. A first technique is used to determine whether there is at least one matching string in the data to be compressed, and a second technique, different from the first technique, is used to determine whether there is at least one matching record in the data to be compressed. Based on there being at least one matching string in the data to be compressed, at least one indication of the at least one matching string is provided to an encoder to facilitate compression of the data. Further, based on there being at least one matching record in the data to be compressed, at least one indication of the at least one matching record is provided to the encoder to facilitate compression of the data. It is transparent to the encoder whether the first technique or the second technique is used to provide one or more matches.

    Length-limited huffman encoding
    39.
    发明授权
    Length-limited huffman encoding 有权

    公开(公告)号：US10756758B1

    公开(公告)日：2020-08-25

    申请号：US16556925

    申请日：2019-08-30

    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION

    Inventor： Bulent Abali ,  Ashutosh Misra ,  Matthias Klein

    IPC: H03M7/40 ,  H03M7/30 ,  G06F9/50

    Abstract: Various embodiments are provided for length-limited Huffman encoding in a data compression accelerator in a computing environment by a processor. Symbol counts of a plurality of symbols in compressed data may be normalized and manipulated according to a maximum code length limiting operation such that those of the plurality of symbols having a least frequent symbol count have a symbol count equal to a maximum code length of a Huffman tree.

Patent Agency Ranking