Meta-Algorithms for Scheduling a Chain of Coarse-Grained Tasks on an Array of Reconfigurable FPGAs

Algorithm 7

Detailed GPRM metaheuristic: this elaborates on the GPRM outline provided in Algorithm 5 by first determining the appropriate DAG structure. It then computes the correct cost model, which can be a combination of any of the cost models used in SPRM 1, GPRM 1, GPRM 2, GPRM 5, and GPRM 6.

GPRM Meta Algorithm

(1) if (Implementation Libraries Used)

(2)  then DAG_Structure = Basic DAG Structure defined in GPRM 3

(3)  else DAG_Structure = Basic DAG Structure defined in GPRM 1

(4) if (Dynamic Task Generation Needed)

(5)  Update DAG Structure as described in GPRM 4

(6) Cost_Model = SPRM 1 Cost Model// baseline cost model

(7) If (Repeated Tasks Present)

(8)    then Update Cost_Model as described in GPRM 1

(9) If (Similar Tasks Present)

(10)  then Update Cost_Model as described in GPRM 2

(11) If (Limited Cycles Present)

(12)  then Update Cost_Model as described in GPRM 5

(13) If (Alternative Cost Functions Needed )

(14)  then Modify Cost_Model as described in GPRM 6

(15) Run Shortest Paths Algorithm. end