National Instruments Corporation

Jacob Kornerup

Jeffrey N Correll

Aljosa Vrancic

Timothy J Hayles

Jeffrey L Kodosky

David W Fuller, Iii

Biren Shah

Kaushik Ravindran

Guang Yu Yang

Hugo A Andrade

John Robert Breyer

Rhishikesh Limaye

Guoqiang Wang

Arkadeb Ghosal

Michael J Trimborn

Charles E Crain, Ii

Sadia B Malik

Michael L Santori

Matthew C Curtis

Ian C Wong

Steve Rogers

Adam K Gabbert

Trung N Tran

Jenifer M Loy

Newton G Petersen

Darshan K Shah

Andrew Philip Dove

Mohammed Kamran Shah

Christopher G Cifra

Joel Sumner

John R Allen

Bob Preis

Ankita Prasad

Patricia Derler

Scott D Postma

Richard M Ashby

Jayson P Ryckman

Charles E Crain Ii

Guang Yang

David W Iii Fuller

John R Bryer

A method for determining timing constraints in dataflow models is disclosed. The method includes receiving node information specifying a plurality of dataflow nodes, as well as coupling between various ones of the dataflow nodes. The method further comprising receiving timing information specifying timing constraints for at least some of the dataflow nodes. Based on the node information, the couplings between the nodes, and the timing information, a timeline dependency graph (TDG). The timeline dependency graph illustrates a timeline, mappings between nodes with side effects to firing times of those nodes on the timeline, and dependencies between nodes.

Determination of timing configurations for program dataflow models

Techniques for specifying and implementing programs. A graphical program is created in a graphical specification and constraint language that allows specification of a model of computation and explicit declaration of constraints in response to user input. The graphical program includes a specified model of computation, a plurality of interconnected functional blocks that visually indicate functionality of the graphical program in accordance with the specified model of computation, and specifications or constraints for the graphical program or at least one of the functional blocks in the graphical program. The specified model of computation and specifications or constraints are useable to analyze the graphical program or generate a program or simulation.

Graphical specification and constraint language for developing programs for hardware implementation and use

System and method for specifying and implementing programs. A graphical program is created in a graphical specification and constraint language that allows specification of a model of computation and explicit declaration of constraints in response to user input. The graphical program includes a specified model of computation, a plurality of interconnected functional blocks that visually indicate functionality of the graphical program in accordance with the specified model of computation, and specifications or constraints for the graphical program or at least one of the functional blocks in the graphical program. The specified model of computation and specifications or constraints are useable to analyze the graphical program or generate a program or simulation.

System and method for optimizing a data flow diagram based on access pattern information are described. Access pattern information for a data flow diagram may be received. The data flow diagram may include a plurality of interconnected actors, e.g., functional blocks, visually indicating functionality of the data flow diagram. The access pattern information may include one or more of: input pattern information specifying cycles on which tokens are consumed by at least one of the actors, or output pattern information specifying cycles on which tokens are produced by at least one of the actors. A program that implements the functionality of the data flow diagram may be generated based at least in part on the access pattern information.

Optimization of a data flow program based on access pattern information

Configuring wires/icons in a diagram. The diagram may be an executable diagram such as a graphical program or a system diagram. The diagram may include a plurality of icons that are connected by wires, and the icons may visually represent functionality of the diagram. The diagram may be executable to perform the functionality. Displaying the diagram may include displaying a first wire in the diagram, where the first wire connects a first icon and a second icon. Data transfer functionality may be specified for the first wire and/or the first or second icon in the diagram. The data transfer functionality may be visually indicated in the diagram, e.g., by appearances of the first icon, the second icon, the first wire, and/or icons displayed proximate to these components of the diagram.

Automatically determining data transfer functionality for wires in a graphical diagram

Providing zooming within a system diagram. Initially, a diagram of a system may be displayed. The diagram may include a plurality of icons representing physical components of the system. These plurality of icons may be initially displayed at a first level of magnification. User input to zoom on a first physical component in the diagram may be received. Accordingly, the first physical component may be displayed at a second level of magnification and other ones of the physical components may be displayed at a third level of magnification. The second level of magnification may be greater than the first level of magnification and the third level of magnification may be less than the first level of magnification. Alternatively, or additionally, different representations for various components of the system may be displayed in the diagram during or after the zoom.

Semantic zoom within a diagram of a system

Developing programs for hardware implementation in a graphical specification and constraint language

Displaying physical signal routing of a system. A diagram of the system may be displayed. The system may include physical components connected via physical connections and logical components implemented on various ones of the physical components. The diagram may include a plurality of icons connected by wires. At least a first subset of the icons may represent logical elements of the system and wires between the first subset of icons may represent logical connections between corresponding logical elements. User input requesting signal routing information of the system may be received. In response, a signal route corresponding to a first logical connection between a first logical element and a second logical element may be visually indicated.

Displaying physical signal routing in a diagram of a system

Developing programs in a graphical specification and constraint language

Developing programs for hardware implementation in a graphical specification and constraint language Via iterative estimation of performance or resource utilization

Graphical diagram which automatically determines a data transport mechanism for wires based on configured policies

A system and method for specifying timing relationships among nodes in a graphical program. User input specifying desired timing of a first node with respect to timing of a second node may be received. In various embodiments, any kind of timing relationship or timing constraint between the first node and the second node may be specified. Timing information may be displayed on the display to visually indicate the timing of the first node with respect to timing of the second node. In one embodiment, displaying the timing information may comprise displaying a timing wire between the first node and the second node. The graphical program may be executed in such a way that the visually indicated timing of the first node with respect to timing of the second node is satisfied.

Graphically representing timing in a graphical program

Timing wires in a graphical program

A system and method for enabling deterministic or time-triggered data exchange between a first graphical program and a second graphical program. A first variable is assigned to a first time slot in a network cycle. A first graphical program may be configured to write data to the first variable. A second graphical program may be configured to read data from the first variable. The first graphical program may be executed on a first computer system, where executing the first graphical program comprises writing data to the first variable. Writing data to the first variable may cause the data to be delivered over a network to a second computer system when the first time slot occurs. The second graphical program may be executed on the second computer system, where executing the second graphical program comprises reading from the first variable the data sent from the first computer system.

Deterministic communication between graphical programs executing on different computer systems using variable nodes

A system and method for creating a distributed application using graphical programming techniques are disclosed. The distributed application may comprise a first graphical program and a second graphical program, where a host computer system executes the first graphical program, and a plurality of remote computer systems or computing devices each execute an instance of the second graphical program. In some embodiments the first graphical program may utilize a node that represents the second graphical program. The node may be operable to exchange data with a plurality of instances of the second graphical program executing on a plurality of remote devices.

Spatial iteration node for a graphical program

Growing community of inventors

Austin, TX, United States of America

Jacob Kornerup