会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • EXECUTING GRAPH-BASED PROGRAM SPECIFICATIONS
    • 执行基于图形的程序规范
    • WO2016036830A1
    • 2016-03-10
    • PCT/US2015/048100
    • 2015-09-02
    • AB INITIO TECHNOLOGY LLC
    • STANFILL, Craig W.SHAPIRO, RichardWEISS, AdamROBERTS, Andrew F.WHOLEY, III, Joseph SkeffingtonGOULD, JoelKUKOLICH, Stephen A.
    • G06F9/44G06F9/50G06F9/45
    • G06F8/43G06F8/34G06F8/433G06F8/447G06F9/44505G06F9/44521G06F9/4494G06F9/5066G06F13/36
    • A graph-based program specification (110) includes components corresponding to tasks and directed links between ports of the components, including: a first type of link configuration between ports of linked components, corresponding to transfer of control or transfer of a single data element, and a second type of link configuration between ports of linked components, corresponding to transfer of multiple data elements. A compiler (120) generates a target program specification including control code representing at least one control graph including graph nodes representing the components, where at least two are connected based on links of the first type. A computing node (152) initiates execution of the target program specification, and manages computing resources for links of the second type, the computing resources including at least one of: a buffer for storing data elements provided by an output port, or a buffer for storing data elements provided to an input port.
    • 基于图形的程序规范(110)包括与组件的端口之间的任务和定向链接相对应的组件,包括:链接组件的端口之间的第一类型的链路配置,对应于单个数据元素的控制或传输的传送, 以及链接组件的端口之间的第二类型的链路配置,对应于多个数据元素的传输。 编译器(120)生成目标程序规范,其包括表示包括表示组件的图形节点的至少一个控制图的控制代码,其中至少两个基于第一类型的链接被连接。 计算节点(152)启动目标程序规范的执行,并且管理第二类型的链路的计算资源,所述计算资源包括以下各项中的至少一个:用于存储由输出端口提供的数据元素的缓冲器或用于 存储提供给输入端口的数据元素。
    • 4. 发明申请
    • ACTION TAGS
    • 行动标签
    • WO2008011019A1
    • 2008-01-24
    • PCT/US2007/016187
    • 2007-07-16
    • YAHOO! INC.AHERN, Shane, P.JAFFE, Alexander, B.KING, Simon, P.NAAMAN, MorNAIR, RahulYANG, Jeannie, Hui-I
    • AHERN, Shane, P.JAFFE, Alexander, B.KING, Simon, P.NAAMAN, MorNAIR, RahulYANG, Jeannie, Hui-I
    • G06F17/00G06F3/048
    • G06F17/3089G06F9/4494G06F9/45512
    • Disclosed are apparatus and methods for performing actions with respect to objects. An object having an action tag, that specifies that a particular action script is to be performed with respect to the object, is provided (102, 104). The action tag (204, 206) can be in the form of a textual label or any suitable user interface object that can be associated with the object. A search (108) is then performed in a plurality of reference action tags (304), that each correspond to a different action script, for the provided action tag. When a matching reference action tag is found for the provided action tag, the corresponding, matching action script is then invoked (110, 308) so that the matching action script is automatically performed with respect to the object. Embodiments of the present invention also provide an action tag management architecture (300) that is independent of the actions that are triggered by the action tags associated with particular objects and, accordingly, provides flexibility by allowing the set of actions to be expanded without requiring code changes to the tag management architecture.
    • 公开了用于对对象执行动作的装置和方法。 提供具有动作标签的对象,其指定要针对对象执行特定动作脚本(102,104)。 动作标签(204,206)可以是文本标签或可以与对象相关联的任何合适的用户界面对象的形式。 然后,对于所提供的动作标签,在多个参考动作标签(304)中执行搜索(108),每个对应于不同的动作脚本。 当为所提供的动作标签找到匹配的参考动作标签时,然后调用相应的匹配动作脚本(110,308),使得相对于对象自动执行匹配动作脚本。 本发明的实施例还提供一种动作标签管理架构(300),其独立于由与特定对象相关联的动作标签触发的动作,并且因此通过允许一组动作被扩展而不需要代码来提供灵活性 更改标签管理架构。
    • 5. 发明申请
    • データ駆動型プロセッサのシミュレータ及びプログラム
    • 数据驱动类型处理器模拟器和程序
    • WO2007037215A1
    • 2007-04-05
    • PCT/JP2006/319020
    • 2006-09-26
    • ソナック株式会社岩本 信一榊原 泰徳菅原 崇之
    • 岩本 信一榊原 泰徳菅原 崇之
    • G06F15/82G06F9/455
    • G06F9/4494
    •  本発明は、データ駆動型プロセッサのシミュレータに関する。本発明によるシミュレータは、模擬対象のデータ駆動型プロセッサ用のプログラムを、ソース及びデスティネーションオペランドのオペランド識別子を含む一連の命令からなる中間語に変換する解析手段と、各オペランド識別子について設定されている値を管理するオペランド管理手段と、中間語の各命令から、発火条件に基づき発火可能な命令を特定する発火判定手段と、発火判定手段による特定後、特定された命令を実行し、実行した命令のデスティネーションオペランドのオペランド識別子について、設定する値を求める発火実行手段とを有する。
    • 提供了数据驱动型处理器的模拟器。 模拟器包括:分析装置,用于将模拟对象的数据驱动型处理器的程序转换为由包括目的地操作数的源和操作数标识符的一系列指令形成的中间字; 操作数管理装置,用于管理为各个操作数标识符设置的值; 点火判断装置,用于根据来自中间字的指令的点火状态来识别能够执行点火的指令; 以及点火执行装置,用于在由点火判断装置识别之后执行特定指令,并根据所执行指令的目的地操作数的操作数标识获得要设置的值。
    • 6. 发明申请
    • METHOD FOR COMPILING AND EXECUTING A PARALLEL PROGRAM
    • 编译和执行并行程序的方法
    • WO2006012742A1
    • 2006-02-09
    • PCT/CA2005/001205
    • 2005-08-03
    • NOVAKOD TECHNOLOGIES INC.MORIN, Luc
    • MORIN, Luc
    • G06F9/06G06F9/45G06F9/46
    • G06F9/45504G06F9/4494G06F17/505
    • A method for multi-platform parallel or real-time machine programming is provided. The method comprises specifying a parallel machine definition code defining a plurality of signal or data processing components and a communication of data or signals between the components, automatically converting the code into computer instructions for execution on an essentially sequential, non-parallel computer processor, a parallel execution of the instructions on the sequential processor and automatically converting the code into hardware programming data for providing parallel hardware operation according to the code, by including, in the hardware programming data, event control circuitry specification, priority control circuitry specification and buffering control circuitry specification to ensure that the hardware operation matches the execution on the sequential computer processor. The parallel machine code is implemented using the hardware programming data on a parallel hardware machine having parallel processing capability and using the computer instructions on the sequential processor in a manner that is essentially exchangeable.
    • 提供了一种用于多平台并行或实时机器编程的方法。 该方法包括指定定义多个信号或数据处理组件的并行机器定义代码以及组件之间的数据或信号的通信,将代码自动转换成计算机指令以在基本上顺序的非并行计算机处理器上执行, 并行执行顺序处理器上的指令,并通过在硬件编程数据中包括事件控制电路规范,优先级控制电路规范和缓冲控制电路,将代码自动转换为硬件编程数据,以提供根据代码的并行硬件操作 规范,以确保硬件操作与顺序计算机处理器上的执行相匹配。 并行机器代码使用具有并行处理能力的并行硬件机器上的硬件编程数据来实现,并且以基本可交换的方式在顺序处理器上使用计算机指令。
    • 7. 发明申请
    • UNIFORM INTERFACE FOR A FUNCTIONAL NODE IN AN ADAPTIVE COMPUTING ENGINE
    • 自适应计算机中功能节点的均匀接口
    • WO2004107189A2
    • 2004-12-09
    • PCT/US2003/037228
    • 2003-11-19
    • QUICKSILVER TECHNOLOGY, INC.
    • SCHEUERMANN, James, W.
    • G06F13/38
    • G06F9/4494
    • A computational unit, or node, in an adaptive computing engine uses a uniform interface to a network to communication with other nodes and resources. The uniform interface is referred to as a "node wrapper." The node wrapper includes a hardware task manager (HTM), a data distributor, optional direct memory access (DMA) enging and a data aggregator. The hardware task manager indicates when input and output buffer resources are sufficient to allow a task to execute. The HTM coordinates a nodes assignment tasks using a task lists. A "ready-to-run queue" is implemented as a first-in first-out stack. The HTM uses top-level finite-state machine (FSM) that communicates with a number of subordinate FSMs to control individual HTM components. The Data Distributor interfaces between the node's input pipeline register and various memories and registers with the node. Different types of data distribution are possible based upon the values in service and auxiliary fields of a 50-bit control structure. The Data Aggregator arbitrates among up to for node elements that request access to the node's output pipeline register for the purpose of transferring data to the intended sestination via the network. The DMA Engine uses a five-register model. The registers include a Startin Address Register, an Address Stride Register, a Transfer Count Register, a Duty Cycle Register, and a Control Register including a GO bit, Target Node number / port number, and DONE protocol. A control node, or "K-node," is used to control various aspects of the HTM, data distributor, data aggregator and DMA operations within the nodes of the system.
    • 自适应计算引擎中的计算单元或节点使用与网络的统一接口与其他节点和资源进行通信。 统一接口被称为“节点包装器”。 节点包装器包括硬件任务管理器(HTM),数据分配器,可选的直接存储器访问(DMA)引导和数据聚合器。 硬件任务管理器指示输入和输出缓冲区资源何时足以允许任务执行。 HTM使用任务列表协调节点分配任务。 “即时运行队列”作为先进先出的堆栈实现。 HTM使用与许多从属FSM进行通信的顶级有限状态机(FSM)来控制各个HTM组件。 数据分发器在节点的输入流水线寄存器和各种存储器之间进行接口,并与节点进行寄存器。 基于50位控制结构的服务和辅助字段的值,可以实现不同类型的数据分发。 数据聚合器在最高节点元素之间仲裁,请求访问节点的输出流水线寄存器,以便通过网络将数据传输到预期的目标。 DMA引擎使用五注册模型。 寄存器包括启动地址寄存器,地址步进寄存器,传输计数寄存器,占空比寄存器和包含GO位,控制寄存器,目标节点号/端口号和DONE协议的控制寄存器。 控制节点或“K节点”用于控制系统节点内的HTM,数据分发器,数据聚合器和DMA操作的各个方面。
    • 9. 发明申请
    • A SCALABLE PROCESSING ARCHITECTURE
    • 可扩展的处理结构
    • WO2003038645A2
    • 2003-05-08
    • PCT/US2002/034965
    • 2002-10-31
    • UNIVERSITY OF TEXASBURGER, DougKECKLER, Stephen, W.SANKARALINGAM, KarthikeyanNAGARAJAN, Ramadass
    • BURGER, DougKECKLER, Stephen, W.SANKARALINGAM, KarthikeyanNAGARAJAN, Ramadass
    • G06F15/76
    • G06F15/8007G06F9/4494
    • A computation node according to various embodiments of the invention includes at least one input port capable of being coupled to at least one first other 5 computation node, a first store coupled to the input port(s) to store input data, a second store to receive and store instructions, an instruction wakeup unit to match the input data to the instructions, at least one execution unit to execute the instructions, using the input data to produce output data, and at least one output port capable of being coupled to at least one second other computation node. The node may also include a router to direct the output data from the output port(s) to the second other node. A system according to various embodiments of the invention includes an external instruction sequencer to fetch a group of instructions, and one or more interconnected, preselected computational nodes. An article according to an embodiment of the invention includes a medium having instructions which are capable of causing a machine to partition a program into a plurality of groups of instructions, assign one or more of the instruction groups to a plurality of interconnected preselected computation nodes, load the instruction groups on to the nodes, and execute the instruction groups as each instruction in each group receives all necessary associated operands for execution.
    • 根据本发明的各种实施例的计算节点包括能够耦合到至少一个第一其他计算节点的至少一个输入端口,耦合到所述输入端口以存储输入数据的第一存储器,用于接收的第二存储器 并且存储指令,将输入数据与指令相匹配的指令唤醒单元,使用输入数据产生输出数据的执行指令的至少一个执行单元,以及至少能够耦合到至少一个 第二个其他计算节点。 节点还可以包括将输出数据从输出端口引导到第二另一个节点的路由器。 根据本发明的各种实施例的系统包括用于获取一组指令的外部指令定序器以及一个或多个互连的预先选择的计算节点。 根据本发明的实施例的物品包括具有能够使机器将程序分成多组指令的指令的介质,将一个或多个指令组分配给多个互连的预选计算节点, 将指令组加载到节点,并执行指令组,因为每个组中的每个指令都接收所有必需的相关操作数以供执行。
    • 10. 发明申请
    • SYNERGETIC DATA FLOW COMPUTING SYSTEM
    • 协同数据流计算系统
    • WO01097054A3
    • 2002-04-11
    • PCT/DK2001/000393
    • 2001-06-08
    • G06F15/16G06F9/30G06F9/38G06F9/44G06F15/173G06F15/82
    • G06F9/30079G06F9/30145G06F9/3824G06F9/3867G06F9/3885G06F9/4494G06F15/17337
    • Synergetic computing system contains a unidirectional each-to-each switchboard (2) with N inputs and 2*N outputs, with N functional units (1.1,..., 1.N) attached, each unit executing its own program (a sequence of binary and unary operations). Results of operations are sent to the switchboard and used as operands by other functional units. The final result of computation is formed as a result of programmed coordinated interaction (synergy) of the functional units (1.1,..., 1.N). Two operating modes are suggested, synchronous and asynchronous. The synchronous mode uses a two-stage pipeline and duration of individual operations has to be taken into account when writing the code. An instruction using a result of another instruction should begin execution in the cycle immediately following the generation of this result. In the asynchronous mode, programming does not need to account for instruction duration and operations are performed upon operand availability. Asynchronous execution is achieved by introducing dynamically assigned individual identification tags for instructions, operands and operation results, and by using ready flags for results, operands and instructions, with buffering of information exchange between concurrent processes in the system.
    • 协同计算系统包含具有N个输入和2个N输出的单向每对交换机(2),其中附加有N个功能单元(1.1,...,1.N),每个单元执行其自己的程序(序列 二进制和一元操作)。 操作结果发送到交换机,并被其他功能单元用作操作数。 计算的最终结果是由功能单元(1.1,...,1.N)的编程协调相互作用(协同作用)的结果形成的。 建议使用两种操作模式,同步和异步。 同步模式使用两级流水线,写入代码时必须考虑单个操作的持续时间。 使用另一条指令的结果的指令应该在生成此结果后立即开始执行。 在异步模式下,编程不需要考虑指令持续时间,并且在操作数可用性上执行操作。 异步执行是通过为指令,操作数和操作结果引入动态分配的单个标识标签,并通过使用结果,操作数和指令的就绪标志,缓冲系统中并发进程之间的信息交换来实现的。