Evaluation of Runtime Task Mapping Using the rSesame Framework

Algorithm 1

Pseudocode for the As Much As Possible heuristic (AMAP) for mapping 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)  {𝑇_𝑖𝑖𝑠𝑚𝑎𝑝𝑝𝑒𝑑𝑜𝑛𝑡𝑜𝐹𝑃𝐺𝐴}

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

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

(7) else

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

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

(10) end if