会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 54. 发明申请
    • AUTO-ORDERING OF STRONGLY ORDERED, DEVICE, AND EXCLUSIVE TRANSACTIONS ACROSS MULTIPLE MEMORY REGIONS
    • 在多个存储区域进行强制订购,设备和独家交易的自动订购
    • WO2013086529A1
    • 2013-06-13
    • PCT/US2012/068820
    • 2012-12-10
    • QUALCOMM INCORPORATED
    • PANAVICH, Jason LawrenceDIEFFENDERFER, James NorrisSARTORIUS, Thomas AndrewSPEIER, Thomas Philip
    • G06F13/16
    • G06F13/1621
    • Efficient techniques are described for controlling ordered accesses in a weakly ordered storage system. A stream of memory requests is split into two or more streams of memory requests and a memory access counter is incremented for each memory request. A memory request requiring ordered memory accesses is identified in one of the two or more streams of memory requests. The memory request requiring ordered memory accesses is stalled upon determining a previous memory request from a different stream of memory requests is pending. The memory access counter is decremented for each memory request guaranteed to complete. A count value in the memory access counter that is different from an initialized state of the memory access counter indicates there are pending memory requests. The memory request requiring ordered memory accesses is processed upon determining there are no further pending memory requests.
    • 描述了用于控制弱订单存储系统中有序访问的高效技术。 存储器请求流被分成两个或更多个存储器请求流,并且每个存储器请求增加存储器访问计数器。 需要有序存储器访问的存储器请求在两个或更多个存储器请求流中的一个中被识别。 在从不同的存储器请求流确定先前的存储器请求正在等待时,需要有序存储器访问的存储器请求被停止。 对于保证完成的每个存储器请求,存储器访问计数器递减。 与存储器访问计数器的初始化状态不同的存储器访问计数器中的计数值指示存在未决存储器请求。 在确定没有进一步的未决存储器请求时,处理需要有序存储器访问的存储器请求。
    • 55. 发明申请
    • LINK STACK REPAIR OF ERRONEOUS SPECULATIVE UPDATE
    • 链路堆栈修复错误的参数更新
    • WO2013026055A1
    • 2013-02-21
    • PCT/US2012/051578
    • 2012-08-20
    • QUALCOMM INCORPORATEDDIEFFENDERFER, James NorrisSTEMPEL, Brian MichaelSMITH, Rodney Wayne
    • DIEFFENDERFER, James NorrisSTEMPEL, Brian MichaelSMITH, Rodney Wayne
    • G06F9/38
    • G06F9/3842G06F9/3806G06F9/3861
    • Whenever a link address is written to the link stack, the prior value of the link stack entry is saved, and is restored to the link stack after a link stack push operation is speculatively executed following a mispredicted branch. This condition is detected by maintaining an incrementing tag register which is incremented by each link stack write instruction entering the pipeline, and a snapshot of the incrementing tag register, associated with each branch instruction. When a branch is evaluated and determined to have been mispredicted, the snapshot associated with it is compared to the incrementing tag register. A discrepancy indicates a link stack write instruction was speculatively issued into the pipeline after the mispredicted branch instruction, and pushed a link address onto the link stack, thus corrupting the link stack. The prior link address is restored to the link stack from the link stack restore buffer.
    • 每当链接地址被写入链接堆栈时,链接堆栈条目的先前值被保存,并且在错误预测的分支之后推测地执行链路堆叠推送操作之后被还原到链路栈。 通过保持由进入管线的每个链路堆栈写入指令递增的递增标签寄存器以及与每个分支指令相关联的递增标签寄存器的快照来检测该条件。 当分支被评估并被确定为被错误预测时,将与之相关联的快照与增量标签寄存器进行比较。 一个差异表示在错误预测的分支指令之后推测发布了一个链路堆栈写入指令,并将链路地址推送到链路堆栈上,从而破坏了链路堆栈。 链路堆栈恢复缓冲区中的链路栈恢复到先前的链路地址。
    • 58. 发明申请
    • SNOOP FILTERING USING A SNOOP REQUEST CACHE
    • 使用SNOOP REQUEST CACHE进行SNOOP过滤
    • WO2008092159A1
    • 2008-07-31
    • PCT/US2008/052216
    • 2008-01-28
    • QUALCOMM IncorporatedDIEFFENDERFER, James Norris
    • DIEFFENDERFER, James Norris
    • G06F12/08
    • G06F12/0831
    • A snoop request cache maintains records of previously issued snoop requests. Upon writing shared data, a snooping entity performs a lookup in the cache. If the lookup hits (and, in some embodiments, includes an identification of a target processor) the snooping entity suppresses the snoop request. If the lookup misses (or hits but the hitting entry lacks an identification of the target processor) the snooping entity allocates an entry in the cache (or sets an identification of the target processor) and directs a snoop request such to the target processor, to change the state of a corresponding line in the processor's L1 cache. When the processor reads shared data, it performs a snoop cache request lookup, and invalidates a hitting entry in the event of a hit (or clears it processor identification from the hitting entry), so that other snooping entities will not suppress snoop requests to it.
    • 侦听请求缓存维护先前发出的窥探请求的记录。 在写共享数据时,侦听实体在缓存中执行查找。 如果查找命中(并且在一些实施例中包括目标处理器的标识),则窥探实体抑制窥探请求。 如果查找未命中(或命中但击中条目缺少目标处理器的标识),则窥探实体在高速缓存中分配条目(或设置目标处理器的标识),并将窥探请求(如目标处理器)引导到 更改处理器的L1缓存中相应行的状态。 当处理器读取共享数据时,它执行窥探高速缓存请求查找,并在命中事件中使命中条目无效(或从命中条目清除处理器标识),以便其他侦听实体不会抑制对其的侦听请求 。