会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 45. 发明申请
    • METHOD TO REDUCE THE ENERGY COST OF NETWORK-ON-CHIP SYSTEMS
    • 降低网络中芯片系统能源成本的方法
    • US20120173846A1
    • 2012-07-05
    • US13325614
    • 2011-12-14
    • Kai Feng WangPeng Fei ZhuHong Xia SunYong Qiang Wu
    • Kai Feng WangPeng Fei ZhuHong Xia SunYong Qiang Wu
    • G06F15/76G06F9/22
    • G06F1/32
    • In a network-on-chip (NoC) system, multiple data messages may be transferred among modules of the system. Power consumption due to the transfer of the messages may affect a cost and overall performance of the system. A described technique provides a way to reduce a volume of data transferred in the NoC system by exploiting redundancy of data messages. Thus, if a data message to be sent from a source in the NoC includes so-called “zero” bytes that are bytes including only bits set to “0,” such zero bytes may not be transmitted in the NoC. Information on whether each byte of the data message is a zero byte may be recorded in a storage such as a data structure. This information, together with non-zero bytes of the data message, may form a compressed version of the data message. The information may then be used to uncompress the compressed data message at a destination.
    • 在片上网络(NoC)系统中,可以在系统的模块之间传送多个数据消息。 由于消息传送引起的功耗可能会影响系统的成本和整体性能。 所描述的技术提供了一种通过利用数据消息的冗余来减少在NoC系统中传送的数据量的方法。 因此,如果要从NoC中的源发送的数据消息包括仅包括设置为“0”的字节的所谓的“零”字节,那么这种零字节可能不会在NoC中发送。 关于数据消息的每个字节是否为零字节的信息可以被记录在诸如数据结构的存储器中。 该信息与数据消息的非零字节可以形成数据消息的压缩版本。 然后可以使用该信息来在目的地解压缩压缩数据消息。
    • 46. 发明申请
    • MODIFIED TREE-BASED MULTICAST ROUTING SCHEMA
    • 改进的基于树的多播路由方案
    • US20120170488A1
    • 2012-07-05
    • US13335480
    • 2011-12-22
    • Kai Feng WANGPengFei ZHUHongXia SUNYongQiang WU
    • Kai Feng WANGPengFei ZHUHongXia SUNYongQiang WU
    • H04L12/56H04L12/28
    • H04L45/06H04L45/16
    • In mesh networks having multiple nodes that communicate data to and from each other, a great number of data transmissions may be initiated and carried out to get data to a proper processing node for execution. To get data where it needs to go (e.g., the proper destination node), a routing algorithm is used to define a set of rules for efficiently passing data from node to node until the destination node is reached. For the purpose of assuring that all data is properly transferred from node to node in a reasonably efficient manner, a routing algorithm may define subsets of nodes into regions and then send data via the regions. Even greater overall efficiency may be realized by recognizing specific adjacency relationships among a group of destination nodes and taking advantage of such adjacencies by rerouting data through regions other than the region in which a destination node resides.
    • 在具有向彼此传递数据的多个节点的网状网络中,可以启动并执行大量数据传输以将数据传送到适当的处理节点以供执行。 为了获得需要去的数据(例如,适当的目的地节点),使用路由算法来定义用于有效地将数据从节点传递到节点的规则集,直到到达目的地节点。 为了确保以合理有效的方式从节点到节点正确传输所有数据,路由算法可以将节点的子集定义为区域,然后经由区域发送数据。 通过识别一组目的地节点之间的特定邻接关系并且通过重新路由数据通过除了目的地节点驻留的区域之外的区域来利用这种相邻性,可以实现更高的整体效率。
    • 47. 发明申请
    • NOVEL REGISTER RENAMING SYSTEM USING MULTI-BANK PHYSICAL REGISTER MAPPING TABLE AND METHOD THEREOF
    • 使用多银行物理寄存器映射表的新型寄存器恢复系统及其方法
    • US20100205409A1
    • 2010-08-12
    • US12700638
    • 2010-02-04
    • Peng Fei ZhuHong-Xia SunYong Qiang Wu
    • Peng Fei ZhuHong-Xia SunYong Qiang Wu
    • G06F9/30G06F1/04
    • G06F9/3012G06F9/384
    • Embodiments of a processor architecture utilizing multi-bank implementation of physical register mapping table are provided. A register renaming system to correlate architectural registers to physical registers includes a physical register mapping table and a renaming logic. The physical register mapping table has a plurality of entries each indicative of a state of a respective physical register. The mapping table has a plurality of non-overlapping sections each of which having respective entries of the mapping table. The renaming logic is coupled to search a number of the sections of the mapping table in parallel to identify entries that indicate the respective physical registers have a first state. The renaming logic selectively correlates each of a plurality of architectural registers to a respective physical register identified as being in the first state. Methods of utilizing the multi-bank implementation of physical register mapping table are also provided.
    • 提供了利用多库实现物理寄存器映射表的处理器架构的实施例。 将结构寄存器与物理寄存器相关联的寄存器重命名系统包括物理寄存器映射表和重命名逻辑。 物理寄存器映射表具有多个表示每个物理寄存器的状态的条目。 映射表具有多个非重叠部分,每个部分具有映射表的相应条目。 重命名逻辑被耦合以并行地搜索映射表的多个部分以识别指示相应物理寄存器具有第一状态的条目。 重命名逻辑选择性地将多个体系结构寄存器中的每一个相关于被识别为处于第一状态的相应物理寄存器。 还提供了利用多库实现物理寄存器映射表的方法。