Evaluation of Runtime Task Mapping Using the rSesame Framework

Algorithm 4

Pseudocode for the Reusability Based Heuristics (RBH) for the mapping on task 𝑇_𝑖.

(1) {𝑇𝑎𝑠𝑘𝑎𝑙𝑟𝑒𝑎𝑑𝑦𝑚𝑎𝑝𝑝𝑒𝑑𝑜𝑛𝑡𝑜𝑡ℎ𝑒𝐹𝑃𝐺𝐴,𝑑𝑜𝑛𝑜𝑡𝑐𝑜𝑛𝑓𝑖𝑔𝑢𝑟𝑒.}

(2) if 𝑇_𝑖 == MAPPED  then

(3) 𝑇_𝑖.state ← RUNNING;

(4) else

(5) if area ≥𝑇_𝑖.area  then

(6)  if Speedup(𝑇_𝑖) > 1  then

(7)   {𝑇𝑎𝑠𝑘𝑛𝑜𝑡𝑚𝑎𝑝𝑝𝑒𝑑𝑜𝑛𝑡𝑜𝑡ℎ𝑒𝐹𝑃𝐺𝐴,𝑐𝑜𝑛𝑓𝑖𝑔𝑢𝑟𝑒𝑖𝑡.}

(8)   configure(𝑇_𝑖);

(9)   𝑇_𝑖.state ← RUNNING;

(10)  end  if

(11) else

(12)  for All tasks 𝑇_𝑗 onto the FPGA  do

(13)   if SpeedUp(𝑇_𝑗) < SpeedUp(𝑇_𝑖)  then

(14)    candidateSet = candidateSet ∪𝑇_𝑗

(15)  end  if

(16) end  for

(17) while area ≤𝑇_𝑖.area  do

(18)  Select 𝑇_𝑘 ∈ candidate Set with lowest RER

(19)  removeSet = removeSet ∪𝑇_𝑘

(20)  area = area + 𝑇_𝑘.area;

(21) end  while

(22) if   𝑇_𝑖.area ≤ area  then

(23)  for All task 𝑇_𝑚∈ removeSet  do

(24)  𝑇_𝑚.state = WAITING;

(25)   end  for

(26)   {𝑇𝑎𝑠𝑘𝑛𝑜𝑡𝑚𝑎𝑝𝑝𝑒𝑑𝑜𝑛𝑡𝑜𝑡ℎ𝑒𝐹𝑃𝐺𝐴,𝑐𝑜𝑛𝑓𝑖𝑔𝑢𝑟𝑒𝑖𝑡.}

(27)   configure(𝑇_𝑖);

(28)   𝑇_𝑖.state ← RUNNING;

(29)   end  if

(30)  end  if

(31) end  if