会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • Manifold Array Processor
    • 歧管阵列处理器
    • US20080052491A1
    • 2008-02-28
    • US11830357
    • 2007-07-30
    • Gerald PechanekCharles Kurak
    • Gerald PechanekCharles Kurak
    • G06F15/80
    • G06F15/17381G06F9/30076G06F15/17337G06F15/8023
    • An array processor includes processing elements (00, 01, 02, 03, 10, 11, 12, 13, 20, 21, 22, 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 torus 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)排列的处理元件(00,01,02,03,10,11,12,13,20,21,22,23,30,31,32,33) ,50)以形成矩形阵列(40)。 群集间通信路径(88)是互斥的。 由于数据路径的相互独占性,每个集群的处理元件之间的通信可以组合在单个集群间路径中,从而消除路径所需的一半接线。 最长通信路径的长度不直接取决于阵列的整体尺寸,如在常规环形阵列中。 相反,最长的通信路径受群间间隔的限制。 NxN环面的转置元素可以组合在一起并通过集群内通信路径相互通信。 这种方法消除了转置操作延迟。 每个PE可以具有单个发送端口(35)和单个接收端口(37)。 因此,各个PE与阵列拓扑分离。
    • 6. 发明申请
    • Manifold Array Processor
    • 歧管阵列处理器
    • US20070150698A1
    • 2007-06-28
    • US11682948
    • 2007-03-07
    • Gerald PechanekCharles Kurak
    • Gerald PechanekCharles Kurak
    • G06F15/00
    • 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与阵列拓扑分离。
    • 7. 发明申请
    • Methods and Apparatus for Meta-Architecture Defined Programmable Instruction Fetch Functions Supporting Assembled Variable Length Instruction Processors
    • 元结构定义的可编程指令获取功能的方法和设备支持组装的可变长度指令处理器
    • US20070180440A1
    • 2007-08-02
    • US11677640
    • 2007-02-22
    • Gerald Pechanek
    • Gerald Pechanek
    • G06F9/45
    • G06F9/3853G06F9/325G06F9/3802G06F9/3804G06F9/3814G06F9/3842G06F9/3885
    • A computing architecture and software techniques are described which modifies the basic sequential instruction fetching mechanism of a processor by separating a program's control flow from its functional execution flow. A compiled sequential HLL program's static control structures are analyzed and a separate program based on its own unique instructions is created that primarily generates addresses for the selection of functional execution instructions. The original program is now represented by an instruction fetch program and a set of function/logic execution instructions. This basic split allows multiple instruction addresses to be generated in parallel to access multiple instruction memories. These multiple instruction memories contain only the function/logic instructions of the program and no control structure operations such as branches or calls. All the original program's control instructions are split from the original program and used to create the instruction addressing program. This approach allows a variable number of instructions to be issued in parallel whenever the program can allow for it. The instructions of this approach are referred to herein as assembled variable length instructions or AVLIs. Alternative techniques are provided that deal with conditional and unconditional branches. In addition, all or a majority of duplicate function/logic instructions can be removed relying on a single copy or a small number of copies to be stored and referenced as needed by the control program based on architecture features so that overall instruction storage can be reduced.
    • 描述了通过将程序的控制流与其功能执行流分离来修改处理器的基本顺序指令获取机制的计算架构和软件技术。 分析编译的顺序HLL程序的静态控制结构,并创建基于其自己的唯一指令的独立程序,主要生成用于选择功能执行指令的地址。 原始程序现在由指令获取程序和一组功能/逻辑执行指令表示。 该基本分割允许并行产生多个指令地址以访问多个指令存储器。 这些多指令存储器仅包含程序的功能/逻辑指令,并且不包括诸如分支或调用的控制结构操作。 所有原始程序的控制指令都是从原始程序中分离出来的,用于创建指令寻址程序。 这种方法允许在程序可以允许的情况下并行发出可变数量的指令。 这种方法的说明在这里被称为组装的可变长度指令或AVLI。 提供了处理有条件和无条件分支的替代技术。 另外,根据架构特征,控制程序根据需要存储和引用单个副本或少量副本,可以删除所有或大部分的重复功能/逻辑指令,从而可以减少总体指令存储 。
    • 9. 发明申请
    • Methods and apparatus for automated generation of abbreviated instruction set and configurable processor architecture
    • 用于自动生成缩写指令集和可配置处理器架构的方法和装置
    • US20060150170A1
    • 2006-07-06
    • US11340072
    • 2006-01-26
    • Sergei LarinGerald PechanekThomas Conte
    • Sergei LarinGerald PechanekThomas Conte
    • G06F9/45
    • 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使用可变长度编码,而不会影响物理指令存储器组织或布局和分支机制,以及将执行核心调整到应用程序。 本文描述的硬件实施例允许在现有技术的实际嵌入式处理器中应用上述高熵编码技术,而不会对定时要求造成显着的压力。