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

Algorithm 1

Metaheuristic that provides a high-level framework for choosing an appropriate algorithm based on the task, implementation, and cost models being considered.

INPUT: Task Model 𝑇, Implementation Model 𝐼, Cost Model 𝐶

// 𝐼 refers to the configuration of the underlying FPGA hardware

(1) if (𝑇 is a Dag and 𝐼 is unstructured)

(2) then Use optimal LIU-based algorithm [13]

(3) else if (𝑇 is a Chain or a Loop and 𝐼 is a single unit/unstructured)

(4) then Use Dynamic Programming [14]

(5) else if (𝑇 is a Chain and 𝐼 is a Linear Array)

(6) then if (𝐶 is a function of adjacent tasks)

(7)     Use SPRM

(8)   else // 𝐶 is a function of all tasks in a configuration

(9)     Use GPRM.

end