An ILP Formulation for the Task Graph Scheduling Problem Tailored to Bi-Dimensional Reconfigurable Architectures
Author(s)
Redaelli, F.; Santambrogio, Marco Domenico; Memik, S. Ogrenci
DownloadSantambrogio_An ILP Formulation.pdf (1.138Mb)
PUBLISHER_POLICY
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
This work proposes an exact ILP formulation for the task scheduling problem on a 2D dynamically and partially reconfigurable architecture. Our approach takes physical constraints of the target device that is relevant for reconfiguration into account. Specifically, we 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 antifragmentation techniques. We experimented with a system employing two reconfigurators. This work also extends the ILP formulation for a HW/SW Codesign scenario. A heuristic scheduler for this extension has been developed too. These systems can be easily implemented using standard FPGAs. Our approach is able to improve the schedule quality by 8.76% on average (22.22% in the best case). Furthermore, our heuristic scheduler obtains
the optimal schedule length in 60% of the considered cases. Our extended analysis demonstrated that HW/SW codesign can indeed lead to significantly better results. Our experiments show that by using our proposed HW/SW codesign method, the schedule length of applications can be reduced by a factor of 2 in the best case.
Date issued
2009-09Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence LaboratoryJournal
International Journal of Reconfigurable Computing
Publisher
Hindawi Publishing
Citation
F. Redaelli, M. D. Santambrogio, and S. Ogrenci Memik, “An ILP Formulation for the Task Graph Scheduling Problem Tailored to Bi-Dimensional Reconfigurable Architectures,” International Journal of Reconfigurable Computing, vol. 2009, Article ID 541067, 12 pages, 2009. doi:10.1155/2009/541067
Version: Final published version