Research Article
An ILP Formulation for the Task Graph Scheduling Problem Tailored to Bi-Dimensional Reconfigurable Architectures
| | computeALAPandSort(,) | | findAvailableTasks() | | while is unscheduled do | | | Reuse true | | for all do | | findFarthestCompatibleModule() | | if then | | schedule(,Reuse) | | | | end if | | end for | | Reuse false | | for all do | | findFarthestAvailableSpace() | | if and free reconfigurators then | | schedule(Reuse) | | | | end if | | end for | | newAvailableNodes() | | t nextControlStep(t) | | end while | | return |
|
