利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

22 条记录 (耗时 0.022 秒)

    PREFERRED WRITE-MOSTLY DATA CACHE REPLACEMENT POLICIES
    21.
    发明申请
    PREFERRED WRITE-MOSTLY DATA CACHE REPLACEMENT POLICIES 失效
    优先写入的数据高速缓存替代政策

    公开(公告)号：US20090113132A1

    公开(公告)日：2009-04-30

    申请号：US11923625

    申请日：2007-10-24

    申请人： Harold Wade Cain, III ,  Jong-Deok Choi ,  Mauricio J. Serrano

    发明人： Harold Wade Cain, III ,  Jong-Deok Choi ,  Mauricio J. Serrano

    IPC分类号： G06F13/28

    CPC分类号： G06F12/127 ,  G06F2212/1021

    摘要： A computer-implemented method of cache replacement includes steps of: determining whether each cache block in a cache memory is a read or a write block; augmenting metadata associated with each cache block with an indicator of the type of access; receiving an access request resulting in a cache miss, the cache miss indicating that a cache block will need to be replaced; examining the indicator in the metadata of each cache block for determining a probability that said cache block will be replaced; and selecting for replacement the cache block with the highest probability of replacement.

    摘要翻译： 计算机实现的高速缓存替换方法包括以下步骤：确定高速缓冲存储器中的每个高速缓存块是读还是写块; 使用所述访问类型的指示符来增强与每个高速缓存块相关联的元数据; 接收导致高速缓存未命中的访问请求，指示高速缓存块将需要被替换的高速缓存未命中; 检查每个高速缓存块的元数据中的指示符，以确定所述高速缓存块将被替换的概率; 并以最高的替换概率选择替换高速缓存块。

    System for target branch prediction using correlation of local target histories including update inhibition for inefficient entries
    22.
    发明授权
    System for target branch prediction using correlation of local target histories including update inhibition for inefficient entries 失效
    使用本地目标历史的相关性进行目标分支预测的系统，包括无效率条目的更新抑制

    公开(公告)号：US07434037B2

    公开(公告)日：2008-10-07

    申请号：US11399979

    申请日：2006-04-07

    申请人： Il Park ,  Mauricio J. Serrano ,  Jong-Deok Choi

    发明人： Il Park ,  Mauricio J. Serrano ,  Jong-Deok Choi

    IPC分类号： G06F9/32

    CPC分类号： G06F9/3806 ,  G06F9/322 ,  G06F9/3848

    摘要： An information processing system includes a branch target buffer (BTB) comprising the last next address for the instruction and for receiving an indirect instruction address and providing a BTB predicted target; and next branch target table (NBTT) for storing potential branch targets based on a history of the branch and for providing an NBTT when the a BTB predicted target is not successful. In another embodiment a system comprising a plurality of branch prediction resources dynamically predicts the best resource appropriate for a branch. The method includes predicting a target branch for an indirect instruction address using a resource chosen among the plurality of branch prediction resources; and selectively inhibiting updates of the branch prediction resources whose prediction accuracy does not meet a threshold.

    摘要翻译： 信息处理系统包括分支目标缓冲器（BTB），其包括用于该指令的最后一个下一个地址，并且用于接收间接指令地址并提供BTB预测目标; 以及用于基于分支的历史存储潜在的分支目标并且当BTB预测目标不成功时提供NBTT的下一分支目标表（NBTT）。 在另一个实施例中，包括多个分支预测资源的系统动态地预测适合于分支的最佳资源。 该方法包括使用在多个分支预测资源中选择的资源来预测间接指令地址的目标分支; 并且选择性地禁止预测精度不满足阈值的分支预测资源的更新。