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

Download Now Date Added: Sep 2009
Format: PDF

This paper proposes an exact ILP formulation for the task scheduling problem on a 2D dynamically and partially reconfigurable architecture. The authors' approach takes physical constraints of the target device that is relevant for reconfiguration into account. Specifically, they consider the limited number of reconfigurators, which are used to reconfigure the device. This work also proposes a reconfiguration-aware heuristic scheduler, which exploits configuration prefetching,module reuse, and anti-fragmentation techniques. They experimented with a system employing two reconfigurators. This paper also extends the ILP formulation for a HW/SW Co-design scenario.