会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 82. 发明公开
    • SYSTEM AND METHOD FOR POWER SAVING IN PIPELINED MICROPROCESSORS
    • 用于管道式微处理器中的节能的系统和方法
    • EP1891516A2
    • 2008-02-27
    • EP06760325.8
    • 2006-05-24
    • Atmel Corporation
    • RENNO, Erik, K.STROM, Oyvind
    • G06F9/30
    • G06F1/3203G06F9/30141G06F9/3824G06F9/3826
    • A system and method for preserving power in a microprocessor pipeline (300). The system includes a register file read control unit (305), the read control unit (305) being configured to monitor one or more outputs from a control /decode unit (205) of the pipeline (300) and monitor write addresses from one or more other stages of the pipeline. The system also includes one or more read inhibit units (301, 303) each having an input, an output, and an enable terminal, the output of each of the one or more read inhibit units (301, 303) being coupled to a unique register port of a register file (109) within the pipeline (300). The input of each of the one or more read inhibit units (301, 303) being coupled to the control/decode unit (205), and the enable terminal of each of the one or more read inhibit units (301, 303) being coupled to a unique output of the read control unit (305).
    • 一种用于在微处理器管线(300)中保存功率的系统和方法。 该系统包括寄存器文件读取控制单元(305),读取控制单元(305)被配置为监测来自流水线(300)的控制/解码单元(205)的一个或多个输出并且监视来自一个或多个 管道的更多其他阶段。 该系统还包括一个或多个读取禁止单元(301,303),每个读取禁止单元具有输入,输出和使能端子,一个或多个读取禁止单元(301,303)中的每一个的输出耦合到唯一的 寄存器管道(300)内的寄存器文件(109)的端口。 一个或多个读取禁止单元(301,303)中的每一个的输入端耦合到控制/解码单元(205),并且一个或多个读取禁止单元(301,303)中的每一个的使能端被耦合 到读取控制单元(305)的唯一输出。
    • 83. 发明公开
    • Content-addressable memory that supports a priority ordering between banks
    • Inhaltsadressierbarer Speicher,der eine Priorisierung zwischen Bankenunterstützt
    • EP1883075A1
    • 2008-01-30
    • EP07252907.6
    • 2007-07-23
    • SUN MICROSYSTEMS, INC.
    • Cypher, Robert E.
    • G11C15/00G06F12/08
    • G11C15/04G06F9/3824G06F9/3826G06F9/3834G06F12/0864
    • One embodiment of the present invention provides a system that implements a content-addressable memory (CAM) which has multiple banks. During operation, the system receives a request to insert an item into the CAM, wherein the request includes a key which is used to index the item and a body containing data. Next, for each bank in the CAM, the system calculates a different hash function based on the key to produce an index and a tag. The system then uses the calculated index and the tag for each bank to lookup an entry in each bank. If the lookups do not generate a hit in any bank, the system stores an entry for the request into a highest priority bank which does not contain a valid entry in the location accessed by the lookup. In one embodiment of the present invention, the multiple banks in the CAM have varying sizes.
    • 本发明的一个实施例提供一种实现具有多个存储体的内容寻址存储器(CAM)的系统。 在操作期间,系统接收将项目插入CAM中的请求,其中该请求包括用于索引项目的密钥和包含数据的主体。 接下来,对于CAM中的每个存储体,系统基于该键计算不同的散列函数以产生索引和标签。 然后,系统使用计算的索引和每个银行的标签来查找每个银行中的条目。 如果查找不在任何存储区中产生命中,则系统将该请求的条目存储到最高优先级的存储库中,该存储体在查找访问的位置中不包含有效条目。 在本发明的一个实施例中,CAM中的多个组具有不同的大小。
    • 84. 发明授权
    • MECHANISM FOR STORE-TO-LOAD FORWARDING
    • 机理“店里加载转送”
    • EP1116103B1
    • 2006-06-21
    • EP99916331.4
    • 1999-04-03
    • ADVANCED MICRO DEVICES, INC.
    • WITT, David, B.
    • G06F9/38
    • G06F9/3834G06F9/3826
    • A load/store unit (42) searches a store queue (64) included therein for each byte accessed by the load independently from the other bytes, and determines the most recent store (in program order) to update that byte. Accordingly, even if one or more bytes accessed by the load are modified by one store while one or more other bytes accessed by the load are modified by another store, the forwarding mechanism may assemble the bytes accessed by the load. More particularly, load data may be forwarded accurately from an arbitrary number of stores. In other words, forwarding may occur up to N stores (where N is the number of bytes accessed by the load). In one particular embodiment, the load/store unit (42) generates a bit vector from a predetermined set of least significant bits of the addresses of loads and stores. The bit vector includes a bit for each byte in a range defined by the number of least significant bits. The bit indicates whether or not the byte is updated (for store bit vectors) or accessed (for load bit vectors). The load/store unit (42) may then examine the bit vectors (and compare the remaining bits of the store and load addresses, exclusive of the least significant bits used to generate the bit vectors) in order to locate the most recent update of each byte.