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

Algorithm 2

SPRM (Straight-Cut) algorithm.

COST(𝑛)

{Compute minimum cost using dynamic programming}

(1) for 𝑙=𝑛−1 down to 0 do // 𝑛 is number of tasks in chain

(2)   𝑐𝑜𝑠𝑡[𝑙]=∞

(3) if (𝑛−𝑙) ≤ 𝑘 then //Base case

(4)   𝑐𝑜𝑠𝑡[𝑙]=0

(5)   𝑓𝑖𝑟𝑠𝑡𝐶𝑢𝑡[𝑙]=𝑛

(6) else // General case

(7)  for 𝑖 in [0,𝑘−1] do // Try 𝑘 cuts, determine which is best

(8)      𝑡𝑒𝑚𝑝𝐶𝑜𝑠𝑡=cost[𝑙+𝑖+1]+𝐶_𝑙+𝑖+1

(9)   if tempCost < 𝑐𝑜𝑠𝑡[𝑙] then

(10)     𝑐𝑜𝑠𝑡[𝑙]=𝑡𝑒𝑚𝑝𝐶𝑜𝑠𝑡

(11)     𝑓𝑖𝑟𝑠𝑡𝐶𝑢𝑡[𝑙]=𝑙+𝑖+1

end