An ILP Formulation for the Task Graph Scheduling Problem Tailored to Bi-Dimensional Reconfigurable Architectures

Algorithm 3

Function newAvailableNodes(SN).

𝑅𝑁^′←∅

for all 𝑆∈𝑆𝑁 do

  for all 𝑆^′∈ successors(𝑆) do

   if predecessors(𝑆^′) are all scheduled then

     𝑅𝑁←𝑅𝑁∪{𝑆^′}

   end if

 end for

end for

return 𝑅𝑁^′