Task scheduling with configuration prefetching and anti-fragmentation techniques on dynamically reconfigurable systems

Authors:
Francesco Redaelli;Marco D. Santambrogio;Donatella Sciuto
Affiliations:
Politecnico di Milano, Milano;Politecnico di Milano, Milano;Politecnico di Milano, Milano
Venue:
Proceedings of the conference on Design, automation and test in Europe
Year:
2008

Citing 6
Cited 2

Temporal partitioning combined with design space exploration for latency minimization of run-time reconfigured designs

DATE '99 Proceedings of the conference on Design, automation and test in Europe
Physically-aware HW-SW partitioning for reconfigurable architectures with partial dynamic reconfiguration

Proceedings of the 42nd annual Design Automation Conference
Considering Run-Time Reconfiguration Overhead in Task Graph Transformations for Dynamically Reconfigurable Architectures

FCCM '05 Proceedings of the 13th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
PARLGRAN: parallelism granularity selection for scheduling task chains on dynamically reconfigurable architectures

ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
Introduction to Mathematical Programming: Applications and Algorithms

Introduction to Mathematical Programming: Applications and Algorithms
Integrating physical constraints in HW-SW partitioning for architectures with partial dynamic reconfiguration

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

An ILP formulation for the task graph scheduling problem tailored to bi-dimensional reconfigurable architectures

International Journal of Reconfigurable Computing - Special issue on selected papers from ReConFig 2008
Floorplacement for partial reconfigurable FPGA-based systems

International Journal of Reconfigurable Computing - Special issue on selected papers from the 17th reconfigurable architectures workshop (RAW2010)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Aim of this paper is to define a scheduling of the task graph of an application that minimizes its total execution time on a partially dynamically reconfigurable FPGA. The scheduler has to take into account the reconfiguration overhead of each task, the area constraint of the target FPGA, the precedences between the tasks, configuration prefetching and module reuse. We introduce an ILP formulation to solve the task scheduling problem in the reconfigurable architecture scenario. This formulation has been used to identify interesting features for a possible heuristic scheduler. The results of the ILP solution show how a reconfiguration-aware scheduler exploiting all the reconfiguration features can outperform one with partial knowledge.