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

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

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 r...

Full description

Bibliographic Details
Main Authors: Redaelli, F., Santambrogio, Marco Domenico, Memik, S. Ogrenci
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: Hindawi Publishing 2010
Online Access:http://hdl.handle.net/1721.1/50638

Internet

http://hdl.handle.net/1721.1/50638

Similar Items