Task graph scheduling for reconfigurable architectures driven by reconfigurations hiding and resources reuse

Authors:
Marco Domenico Santambrogio;Massimo Redaelli;Marco Maggioni
Affiliations:
Politecnico di Milano, Milano, Italy;Politecnico di Milano, Milano, Italy;Politecnico di Milano, Milano, Italy
Venue:
Proceedings of the 19th ACM Great Lakes symposium on VLSI
Year:
2009

Citing 11
Cited 2

Compilation for FPGA-Based Reconfigurable Hardware

IEEE Design & Test
Loop Dissevering: A Technique for Temporally Partitioning Loops in Dynamically Reconfigurable Computing Platforms

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Register allocation and spilling via graph coloring

ACM SIGPLAN Notices - Best of PLDI 1979-1999
Specific scheduling support to minimize the reconfiguration overhead of dynamically reconfigurable hardware

Proceedings of the 41st annual Design Automation Conference
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
Optimal reconfiguration sequence management

ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
Compiler-driven FPGA-area allocation for reconfigurable computing

Proceedings of the conference on Design, automation and test in Europe: Proceedings
Integrating physical constraints in HW-SW partitioning for architectures with partial dynamic reconfiguration

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
On combining temporal partitioning and sharing of functional units in compilation for reconfigurable architectures

IEEE Transactions on Computers

ISBA: an independent set-based algorithm for automated partial reconfiguration module generation

Proceedings of the International Conference on Computer-Aided Design
Congestion-aware scheduling for NoC-based reconfigurable systems

DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is focused on the scheduling of tasks on partially dynamically reconfigurable FPGA s in order to minimize the overall latency of the application. We propose a novel approach to the partitioning of a system specification by detecting recurrent structures in the specification itself. This technique has the objective of identifying modules that can be used more than once during the system lifetime. In such a scenario the reconfiguration overhead is minimized via both the device resource reuse, due to the partitioner, and the reconfiguration time hiding, due to the scheduler. A model of reconfigurable hardware, both for the device and the application, will also be defined and presented.