The Community for Technology Leaders
Parallel and Distributed Processing Symposium, International (2008)
Miami, FL, USA
Apr. 14, 2008 to Apr. 18, 2008
ISBN: 978-1-4244-1693-6
pp: 1-8
Koen Bertels , Computer Engineering Lab., TU Delft, The Netherlands
Georgi Gaydadjiev , Computer Engineering Lab., TU Delft, The Netherlands
Thomas Marconi , Computer Engineering Lab., TU Delft, The Netherlands
Roel Meeuws , Computer Engineering Lab., TU Delft, The Netherlands
Yi Lu , Computer Engineering Lab., TU Delft, The Netherlands
ABSTRACT
With the arrival of partial reconfiguration technology, modern FPGAs support swapping tasks in or out individually at run-time without interrupting other tasks running on the same FPGA. Although, implementing this feature achieves much better flexibility and device utilization, the challenge remains to quickly and efficiently place tasks arriving at run-time on such partially reconfigurable systems. In this paper, we propose an algorithm to handle this on-line, run-time task placement problem. By adding logical constraints on the FPGA and introducing our resources management solution, the simulation results show our algorithm has better overall performances compared with previous reported methods in terms of task rejection number, placement quality and execution time.
INDEX TERMS
CITATION
Koen Bertels, Georgi Gaydadjiev, Thomas Marconi, Roel Meeuws, Yi Lu, "A self-adaptive on-line task placement algorithm for partially reconfigurable systems", Parallel and Distributed Processing Symposium, International, vol. 00, no. , pp. 1-8, 2008, doi:10.1109/IPDPS.2008.4536505
92 ms
(Ver 3.3 (11022016))