International Journal of Reconfigurable Computing

Research Article

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

Algorithm 2

Procedure schedule( Reuse).
 place(
  if Reuse = true then
   
  else
   
   
  end if
  for all predecessors( ) do
   
  end for