会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • Specifying different type generalized event and action pair in a processor
    • 在处理器中指定不同类型的广义事件和动作对
    • US20050125644A1
    • 2005-06-09
    • US10786604
    • 2004-02-25
    • Edwin BarryPatrick MarchandGerald PechanekCharles Kurak
    • Edwin BarryPatrick MarchandGerald PechanekCharles Kurak
    • G06F9/00G06F9/30G06F9/32G06F15/00
    • G06F9/30054G06F9/30101G06F9/30112G06F9/325
    • A processor with a generalized eventpoint architecture, which is scalable for use in a very long instruction word (VLIW) array processor, such as the manifold array (ManArray) processor is described. In one aspect, generalized processor event (p-event) detection facilities are provided by use of compares to check if an instruction address, a data memory address, an instruction, a data value, arithmetic-condition flags, or other processor change of state eventpoint has occurred. In another aspect, generalized processor action (p-action) facilities are provided to cause a change in the program flow by loading the program counter with a new instruction address, generate an interrupt, signal a semaphore, log or count the p-event, time stamp the event, initiate a background operation, or to cause other p-actions to occur. The generalized facilities are defined in the eventpoint architecture as consisting of a control register and three eventpoint parameters, namely at least one register to compare against, a register containing a second compare register, a vector address, or parameter to be passed, and a count or mask register. Based upon this generalized eventpoint architecture, new capabilities are enabled. For example, auto-looping with capabilities to branch out of a nested auto-loop upon detection of a specified condition, background DMA facilities, the ability to link a chain of p-events together for debug purposes, and others are all important capabilities which are readily obtained.
    • 描述了具有广泛事件点架构的处理器,其可扩展以用于非常长的指令字(VLIW)阵列处理器,例如歧管阵列(ManArray)处理器。 在一个方面,通过使用比较来提供广义处理器事件(p事件)检测设施,以检查指令地址,数据存储器地址,指令,数据值,算术条件标志或其他处理器状态变化 事件点已发生。 在另一方面,提供通用处理器动作(p-action)功能以通过用新的指令地址加载程序计数器来产生程序流程的改变,生成中断,信号信号,记录或计数p事件, 事件时间戳,启动后台操作,或导致其他动作发生。 广义设施在事件点架构中被定义为由控制寄存器和三个事件点参数组成,即至少要有一个要比较的寄存器,一个包含第二个比较寄存器的寄存器,一个向量地址或要传递的参数,以及一个计数 或屏蔽寄存器。 基于这种广义的事件点架构,启用了新的功能。 例如,在检测到指定的条件时,自动循环具有分支出嵌套自动循环的功能,后台DMA设施,将p个事件链链接在一起用于调试目的的能力等等都是重要的功能 容易获得。
    • 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. 发明申请
    • 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与阵列拓扑分离。
    • 9. 发明申请
    • 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。 提供了处理有条件和无条件分支的替代技术。 另外,根据架构特征,控制程序根据需要存储和引用单个副本或少量副本,可以删除所有或大部分的重复功能/逻辑指令,从而可以减少总体指令存储 。