US 2017/0286342 A1 · Determination of Timing Configurations for Program Dataflow Models

Abstract

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.

Claims20

Dependent claims

A method, comprising:

specifying, using a computer system, node information for a plurality of dataflow nodes, wherein each of the nodes is a program function that consumes data on at least one input and produces data on at least one output, and wherein the node information includes couplings between particular ones of the nodes;
specifying, using the computer system, timing constraints for one or more of the nodes;
generating, using the computer system, a timeline dependency graph (TDG) based on the node information, couplings between particular ones of the nodes, and the timing constraints, wherein the TDG includes a timeline, mappings between particular ones of the nodes that have side effects, on the timeline, to their respective firing times, and dependencies between nodes;
and
displaying the TDG on a display unit coupled to the computer system.

2 more elements

A non-transitory computer readable medium storing instructions that, when executed by a computer system, cause the computer system to perform the following:

specify node information for a plurality of dataflow nodes of the multi-rate dataflow program, wherein each of the nodes is a program function that consumes data on at least one input and produces data on at least one output, and wherein the node information includes couplings between particular ones of the nodes;
specify, using the computer system, timing constraints for one or more of the nodes;
generate, using the computer system, a timeline dependency graph (TDG) based on the node information, couplings between particular ones of the nodes, and the timing constraints, wherein the TDG includes a timeline, mappings between particular ones of the nodes that have side effects, on the timeline, to their respective firing times, and dependencies between nodes;
and
display the TDG on a display unit coupled to the computer system.

2 more elements

Dependencies are inferred from the claim text.

Facts

Application

15/471,792Filed 28 Mar 2017

Priority

31 Mar 2016

Published

5 Oct 2017

Term ends

Not estimatedThe source records don’t support an estimate.

Classification5 codes

G06F 9/5011
To service a request: the resources being hardware resources other than CPUs, Servers and Terminals
G06F 9/5066
Partitioning or combining of resources: algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs
G06F 13/366
With centralised access control: using a centralised polling arbiter
G06F 13/4068
Device-to-bus coupling: electrical coupling

Determination of Timing Configurations for Program Dataflow Models

Life of this patent

Determination of Timing Configurations for Program Dataflow Models

Life of this patent

Abstract

Claims20