会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Branch history guided instruction/data prefetching
    • 分支历史指导/数据预取
    • US06560693B1
    • 2003-05-06
    • US09459739
    • 1999-12-10
    • Thomas R. PuzakAllan M. HartsteinMark CharneyDaniel A. PrenerPeter H. OdenVijayalakshmi Srinivasan
    • Thomas R. PuzakAllan M. HartsteinMark CharneyDaniel A. PrenerPeter H. OdenVijayalakshmi Srinivasan
    • G06F1500
    • G06F9/383G06F9/30047G06F9/3455G06F9/3836G06F9/3844
    • A mechanism is described that prefetches instructions and data into the cache using a branch instruction as a prefetch trigger. The prefetch is initiated if the predicted execution path after the branch instruction matches the previously seen execution path. This match of the execution paths is determined using a branch history queue that records the branch outcomes (taken/not taken) of the branches in the program. For each branch in this queue, a branch history mask records the outcomes of the next N branches and serves as an encoding of the execution path following the branch instruction. The branch instruction along with the mask is associated with a prefetch address (instruction or data address) and is used for triggering prefetches in the future when the branch is executed again. A mechanism is also described to improve the timeliness of a prefetch by suitably adjusting the value of N after observing the usefulness of the prefetched instructions or data.
    • 描述了使用分支指令作为预取触发器将指令和数据预取到高速缓存中的机制。 如果分支指令之后的预测执行路径与先前查看的执行路径匹配,则启动预取。 使用分支历史队列确定执行路径的这种匹配,该分支历史队列记录节目中分支的分支结果(已取/未采用)。 对于该队列中的每个分支,分支历史掩码记录下一个N个分支的结果,并且作为分支指令之后的执行路径的编码。 分支指令与掩码一起与预取地址(指令或数据地址)相关联,并且在再次执行分支时用于触发预取。 还描述了一种机制,以通过在观察到预取指令或数据的有用性之后适当地调整N的值来提高预取的及时性。
    • 3. 发明授权
    • Methods for caching cache tags
    • 高速缓存标记缓存方法
    • US06311253B1
    • 2001-10-30
    • US09336953
    • 1999-06-21
    • Albert ChangMark CharneyRobert K. MontoyeThomas R. Puzak
    • Albert ChangMark CharneyRobert K. MontoyeThomas R. Puzak
    • G06F1208
    • G06F12/0897G06F12/0864
    • A method for storing information in a computer memory system includes maintaining an Mth level storage system including an Mth level data store for storing data, an Mth level full directory for storing a set of tags corresponding to the data, and an Mth level partial directory for storing a subset of the tags. The partial directory is accessible faster than the full directory. Upon an M-1 level miss corresponding to a request for data, a congruence class corresponding to the request is fetched from the partial directory when it is present therein; otherwise, it is fetched from the full directory. The requested data is retrieved from the data store when it is present in the congruence class; otherwise, it is retrieved from a next level of the memory system. The tags in the partial directory may be full tags, partial tags, or a combination thereof.
    • 一种用于在计算机存储器系统中存储信息的方法包括维护包括用于存储数据的第M级数据存储器的第M级存储系统,用于存储对应于数据的一组标签的第M级完整目录,以及用于 存储标签的子集。 部分目录可访问速度快于完整目录。 在与数据请求相对应的M-1级丢失时,当存在对应于该请求的等同类时,从部分目录中取出; 否则,它将从完整目录中获取。 当数据存储在同余类中时,从数据存储中检索所请求的数据; 否则,它从存储器系统的下一级检索。 部分目录中的标签可以是完整标签,部分标签或其组合。