Evaluation of Runtime Task Mapping Using the rSesame Framework

Algorithm 3

Pseudocode for the Interval Based Heuristics (IBH) for the mapping on task 𝑇_𝑖.

(1) 𝑇 ← set of all tasks.

(2) while  𝑇!=∅ and area ≤ Total_area do

(3)  Select 𝑇_𝑖 with maximum frequency count

(4)  if area + 𝑇_𝑖.area≤ Total_area then

(5)   map 𝑇_𝑖 onto the FPGA

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

(7) else

(8)   map 𝑇_𝑖 onto the GPP

(9) end  if

(10) Remove 𝑇_𝑖 from 𝑇

(11) end  while

(12) Map rest of the tasks from 𝑇 onto the GPP