会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Methods and apparatus for automated generation of abbreviated instruction set and configurable processor architecture
    • 用于自动生成缩写指令集和可配置处理器架构的方法和装置
    • US07865692B2
    • 2011-01-04
    • US11340072
    • 2006-01-26
    • Sergei Yurievich LarinGerald George PechanekThomas M. Conte
    • Sergei Yurievich LarinGerald George PechanekThomas M. Conte
    • G06F12/00
    • G06F9/30178G06F8/447G06F9/30156G06F9/30167
    • A systematic approach to architecture and design of the instruction fetch mechanisms and instruction set architectures in embedded processors is described. This systematic approach allows a relaxing of certain restrictions normally imposed by a fixed-size instruction set architecture (ISA) on design and development of an embedded system. The approach also guarantees highly efficient usage of the available instruction storage which is only bounded by the actual information contents of an application or its entropy. The result of this efficiency increase is a general reduction of the storage requirements, or a compression, of the instruction segment of the original application. An additional feature of this system is the full decoupling of the ISA from the core architecture. This decoupling allows usage of a variable length encoding for any size of the ISA without impacting the physical instruction memory organization or layout and branching mechanism as well as tuning of the execution core to the application. A hardware embodiment described herein allows application of the above mentioned high-entropy encoding technique in actual embedded processor using today's technology without posing significant strain on timing requirements.
    • 描述了嵌入式处理器中的指令获取机制和指令集架构的架构和设计的系统方法。 这种系统的方法允许放松通常由固定大小的指令集架构(ISA)对嵌入式系统的设计和开发施加的某些限制。 该方法还保证可用指令存储器的高效使用,该指令存储器仅由应用程序或其熵的实际信息内容限定。 这种效率提高的结果是原始应用的指令段的存储要求或压缩的普遍降低。 该系统的另一个特点是ISA与核心架构的完全解耦。 这种去耦允许对任何大小的ISA使用可变长度编码,而不会影响物理指令存储器组织或布局和分支机制,以及将执行核心调整到应用程序。 本文描述的硬件实施例允许在现有技术的实际嵌入式处理器中应用上述高熵编码技术,而不会对定时要求造成显着的压力。
    • 3. 发明授权
    • Processor organized in clusters of processing elements and cluster interconnections by a clustering process
    • 处理器通过集群过程组织在处理元件和集群互连的集群中
    • US07631165B2
    • 2009-12-08
    • US11682948
    • 2007-03-07
    • Gerald George PechanekCharles W. Kurak, Jr.
    • Gerald George PechanekCharles W. Kurak, Jr.
    • G06F15/80
    • G06F15/17381G06F9/30076G06F15/17337G06F15/8023
    • An array processor includes processing elements (00, 01, 02, 03, 10, 11, 12, 13, 20, 21, 23, 30, 31, 32, 33) arranged in clusters (e.g., 44, 46, 48, 50) to form a rectangular array (40). Inter-cluster communication paths (88) are mutually exclusive. Due to the mutual exclusivity of the data paths, communications between the processing elements of each cluster may be combined in a single inter-cluster path, thus eliminating half the wiring required for the path. The length of the longest communication path is not directly determined by the overall dimension of the array, as in conventional torus arrays. Rather, the longest communications path is limited by the inter-cluster spacing. Transpose elements of an N×N torts may be combined in clusters and communicate with one another through intra-cluster communications paths. Transpose operation latency is eliminated in this approach. Each PE may have a single transmit port (35) and a single receive port (37). Thus, the individual PEs are decoupled from the array topology.
    • 阵列处理器包括以簇(例如,44,46,48,50)排列的处理元件(00,01,02,03,10,11,12,13,20,21,23,30,31,32,33) )以形成矩形阵列(40)。 群集间通信路径(88)是互斥的。 由于数据路径的相互独占性,每个集群的处理元件之间的通信可以组合在单个集群间路径中,从而消除路径所需的一半接线。 最长通信路径的长度不直接取决于阵列的整体尺寸,如在常规环形阵列中。 相反,最长的通信路径受群间间隔的限制。 NxN侵权的转置元素可以组合在一起并通过集群内通信路径相互通信。 这种方法消除了转置操作延迟。 每个PE可以具有单个发送端口(35)和单个接收端口(37)。 因此,各个PE与阵列拓扑分离。