SYSTEM AND METHOD FOR MULTIPLEXER TREE INDEXING

    公开(公告)号:US20220237164A1

    公开(公告)日:2022-07-28

    申请号:US17721748

    申请日:2022-04-15

    Abstract: Described herein is a system and method for multiplexer tree (muxtree) indexing. Muxtree indexing performs hashing and row reduction in parallel by use of at least one bit in a lookup address at least once in a particular path of the muxtree. The muxtree indexing generates a different final index as compared to conventional hashed indexing but still results in a fair hash, where all table entries get used with equal distribution with uniformly random selects.

    INSTRUCTION ADDRESS TRANSLATION AND INSTRUCTION PREFETCH ENGINE

    公开(公告)号:US20210406024A1

    公开(公告)日:2021-12-30

    申请号:US16913520

    申请日:2020-06-26

    Abstract: Techniques for performing instruction fetch operations are provided. The techniques include determining instruction addresses for a primary branch prediction path; requesting that a level 0 translation lookaside buffer (“TLB”) caches address translations for the primary branch prediction path; determining either or both of alternate control flow path instruction addresses and lookahead control flow path instruction addresses; and requesting that either the level 0 TLB or an alternative level TLB caches address translations for either or both of the alternate control flow path instruction addresses and the lookahead control flow path instruction addresses.

    BRANCH TARGET BUFFER COMPRESSION
    4.
    发明申请

    公开(公告)号:US20180060073A1

    公开(公告)日:2018-03-01

    申请号:US15252164

    申请日:2016-08-30

    Inventor: Steven R. Havlir

    Abstract: Techniques for improving branch target buffer (“BTB”) operation. A compressed BTB is included within a branch prediction unit along with an uncompressed BTB. To support prediction of up to two branch instructions per cycle, the uncompressed BTB includes entries that each store data for up to two branch predictions. The compressed BTB includes entries that store data for only a single branch instruction for situations where storing that single branch instruction in the uncompressed BTB would waste space in that buffer. Space would be wasted in the uncompressed BTB due to the fact that, in order to support two branch lookups per cycle, prediction data for two branches must have certain features in common (such as cache line address) in order to be stored together in a single entry.

    System and method for multiplexer tree indexing

    公开(公告)号:US11308057B2

    公开(公告)日:2022-04-19

    申请号:US15824771

    申请日:2017-11-28

    Abstract: Described herein is a system and method for multiplexer tree (muxtree) indexing. Muxtree indexing performs hashing and row reduction in parallel by use of each select bit only once in a particular path of the muxtree. The muxtree indexing generates a different final index as compared to conventional hashed indexing but still results in a fair hash, where all table entries get used with equal distribution with uniformly random selects.

    Branch target buffer compression
    10.
    发明授权

    公开(公告)号:US10592248B2

    公开(公告)日:2020-03-17

    申请号:US15252164

    申请日:2016-08-30

    Inventor: Steven R. Havlir

    Abstract: Techniques for improving branch target buffer (“BTB”) operation. A compressed BTB is included within a branch prediction unit along with an uncompressed BTB. To support prediction of up to two branch instructions per cycle, the uncompressed BTB includes entries that each store data for up to two branch predictions. The compressed BTB includes entries that store data for only a single branch instruction for situations where storing that single branch instruction in the uncompressed BTB would waste space in that buffer. Space would be wasted in the uncompressed BTB due to the fact that, in order to support two branch lookups per cycle, prediction data for two branches must have certain features in common (such as cache line address) in order to be stored together in a single entry.

Patent Agency Ranking