Optimization of a Data Flow Program Based on Access Pattern Information
First Claim
1. A non-transitory computer accessible memory medium that stores program instructions executable by a processor to implement:
- receiving access pattern information for a data flow diagram, wherein the data flow diagram includes a plurality of interconnected actors visually indicating functionality of the data flow diagram, wherein the access pattern information includes one or more of;
a) input pattern information specifying the time at which tokens are consumed by at least one of the actors, or b) output pattern information specifying the time at which tokens are produced by at least one of the actors; and
generating a program that implements the functionality of the data flow diagram based at least in part on the access pattern information.
5 Assignments
0 Petitions
Accused Products
Abstract
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.
82 Citations
32 Claims
-
1. A non-transitory computer accessible memory medium that stores program instructions executable by a processor to implement:
-
receiving access pattern information for a data flow diagram, wherein the data flow diagram includes a plurality of interconnected actors visually indicating functionality of the data flow diagram, wherein the access pattern information includes one or more of;
a) input pattern information specifying the time at which tokens are consumed by at least one of the actors, or b) output pattern information specifying the time at which tokens are produced by at least one of the actors; andgenerating a program that implements the functionality of the data flow diagram based at least in part on the access pattern information. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30)
-
-
31. A method comprising:
utilizing a computer to perform; receiving access pattern information for a data flow diagram, wherein the data flow diagram includes a plurality of interconnected actors visually indicating functionality of the data flow diagram, wherein the access pattern information includes one or more of;
a) input pattern information specifying the time at which tokens are consumed by at least one of the actors, or b) output pattern information specifying the time at which tokens are produced by at least one of the actors; andgenerating a program that implements the functionality of the data flow diagram based at least in part on the access pattern information.
-
32. A non-transitory computer accessible memory medium that stores program instructions executable by a processor to implement:
-
receiving access pattern information for a data flow specification, wherein the data flow specification specifies a plurality of functional actors that perform functionality according to a data flow model of computation, wherein the access pattern information includes one or more of;
a) input pattern information specifying the time at which tokens are consumed by at least one of the functional actors, or b) output pattern information specifying the time at which tokens are produced by at least one of the functional actors; andgenerating a program that implements the functionality based on the data flow specification and the access pattern information.
-
Specification