Method and system for scheduling in an adaptable computing engine
First Claim
Patent Images
1. A method for scheduling an assembled program in an adaptable computing engine, the method comprising:
- providing a plurality of computation units as hardware resources available to perform a particular segment of the assembled program;
representing the particular segment as a dataflow graph; and
refining a schedule that allocates the plurality of computation units in correspondence with the dataflow graph in an iterative manner until a feasible schedule is achieved.
8 Assignments
0 Petitions
Accused Products
Abstract
Aspects of a scheduler for an adaptable computing engine are described. The aspects include providing a plurality of computation units as hardware resources available to perform a particular segment of an assembled program on an adaptable computing engine. A schedule for the particular segment is refined by allocating the plurality of computation units in correspondence with a dataflow graph that represents the particular segment in an interactive manner until a feasible schedule is achieved.
-
Citations
26 Claims
-
1. A method for scheduling an assembled program in an adaptable computing engine, the method comprising:
-
providing a plurality of computation units as hardware resources available to perform a particular segment of the assembled program;
representing the particular segment as a dataflow graph; and
refining a schedule that allocates the plurality of computation units in correspondence with the dataflow graph in an iterative manner until a feasible schedule is achieved. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26)
-
-
12. A system for scheduling an assembled program in an adaptable computing engine, the system comprising:
-
a plurality of computation units for providing hardware resources available to perform a particular segment of the assembled program;
a host controller for configuring the plurality of computation units; and
means for scheduling and allocating the plurality of computation units to perform the particular segment by refining a schedule that allocates the plurality of computation units in correspondence with a dataflow graph representative of the particular segment in an iterative manner until a feasible schedule is achieved
-
-
23. A method for determining an optimal schedule for a matrix of computation units in an adaptable computing engine, the method comprising:
-
determining a value representative of a cost for a chosen schedule of utilizing the matrix to perform a code segment;
adjusting the chosen schedule randomly through small incremental steps until the value reaches an acceptable cost level; and
designating a feasible schedule once the acceptable cost level is reached.
-
Specification