Evaluation of Runtime Task Mapping Using the rSesame Framework

Algorithm 2

Pseudocode for the cumulative benefit heuristic (CBH) for the mapping on task 𝑇_𝑖.

(1)  HW← set of tasks mapped onto the FPGA

(2)  SW← set of tasks mapped onto the GPP

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

(4) if CB(𝑇_𝑖) > (𝑇_SW(𝑖)−𝑇_HW(𝑖))  then

(5)   {𝑇_𝑖𝑖𝑠𝑚𝑎𝑝𝑝𝑒𝑑𝑜𝑛𝑡𝑜𝑡ℎ𝑒𝐹𝑃𝐺𝐴}

(6)   𝐻𝑊=𝐻𝑊∪𝑇_𝑖

(7)   area = area −𝑇_𝑖.area

(8) end if

(9) else

(10) {𝑁𝑜𝑡𝑒𝑛𝑜𝑢𝑔ℎ𝑎𝑟𝑒𝑎,𝑠𝑤𝑎𝑝𝑡ℎ𝑒𝑚𝑎𝑝𝑝𝑒𝑑𝑡𝑎𝑠𝑘𝑠.}

(11) while area ≤𝑇_𝑗.area and 𝑗∈ HW do

(12)   if CB(𝑇_𝑖) - (𝑇_SW(𝑖)−𝑇_HW(𝑖)) > CB(𝑇𝑗)  then

(13)   area = area + 𝑇_𝑗.area

(14)    end if

(15) end  while

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

(17)   {𝑇_𝑖𝑖𝑠𝑚𝑎𝑝𝑝𝑒𝑑𝑜𝑛𝑡𝑜𝑡ℎ𝑒𝐹𝑃𝐺𝐴}

(18)   HW=HW∪𝑇_𝑖

(19)   area = area − 𝑇_𝑖.area

(20) else

(21)   {𝑀𝑎𝑝𝑇_𝑖𝑜𝑛𝑡𝑜𝑡ℎ𝑒𝐺𝑃𝑃}

(22)   𝑆𝑊=𝑆𝑊∪𝑇_𝑖

(23) end  if

(24) end  if