Off-line placement of hardware tasks on FPGA

The new tendencies in designing real-time systems indicate that the future applications will be built on reconfigurable hardware devices. These applications require high performance and reasonable flexibility towards user and environment needs. To fulfill these application requirements, the density of heterogeneous resources evolves within these devices. Hence, the complexity of these devices leads to the search of efficient mechanisms to manage hardware resources. The proposed placement methods suffer from issues of fragmentation, tasks rejection, and overheads. This paper focuses on an off-line flow of hardware tasks' classification that aims at the optimized use of the resources and targets all above mentioned issues.

[1]  Majid Sarrafzadeh,et al.  Fast Template Placement for Reconfigurable Computing Systems , 2000, IEEE Des. Test Comput..

[2]  Marco Platzner,et al.  Online scheduling and placement of real-time tasks to partially reconfigurable devices , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[3]  Daniel Chillet,et al.  Flexible communication support for dynamically reconfigurable FPGAS , 2009, 2009 5th Southern Conference on Programmable Logic (SPL).

[4]  Ranga Vemuri,et al.  An efficient algorithm for finding empty space for online FPGA placement , 2004, Proceedings. 41st Design Automation Conference, 2004..

[6]  Georgi Gaydadjiev,et al.  Intelligent Merging Online Task Placement Algorithm for Partial Reconfigurable Systems , 2008, 2008 Design, Automation and Test in Europe.

[7]  Jürgen Teich,et al.  A new approach for on-line placement on reconfigurable devices , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..