Intelligent Merging Online Task Placement Algorithm for Partial Reconfigurable Systems

Speed and placement quality are two very important attributes of a good online placement algorithm, because the time taken by the algorithm is considered as an overhead to the application overall execution time. To solve this problem, we propose three techniques: Merging Only if Needed (MON), Partial Merging (PM), and Direct Combine (DC). Our IM (intelligent merging) algorithm uses dynamically these three techniques to exploit their specific advantages. IM outperforms Bazargan's algorithm as it has placement quality within 0.89% but is 1.72 times faster.

[1]  Masaki Nakanishi,et al.  An Efficient and Effective Algorithm for Online Task Placement with I/O Communications in Partially Reconfigurable FPGAs , 2006, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[2]  M. Nakanishi,et al.  A New Approach to Online FPGA Placement , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[3]  Weichen Liu,et al.  An Efficient Algorithm for Online Soft Real-Time Task Placement on Reconfigurable Hardware Devices , 2007, 10th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'07).

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

[5]  Ranga Vemuri,et al.  An Integrated Online Scheduling and Placement Methodology , 2004, FPL.

[6]  Hortensia Mecha,et al.  A vertex-list approach to 2D HW multitasking management in RTR FPGAs , 2003 .

[7]  Hortensia Mecha,et al.  A Low Fragmentation Heuristic for Task Placement in 2D RTR HW Management , 2004, FPL.

[8]  Zonghua Gu,et al.  An Efficient Algorithm for Online Management of 2D Area of Partially Reconfigurable FPGAs , 2007, 2007 Design, Automation & Test in Europe Conference & Exhibition.

[9]  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.

[10]  Jürgen Teich,et al.  A Dynamic Scheduling and Placement Algorithm for Reconfigurable Hardware , 2004, ARCS.

[11]  Marco Platzner,et al.  Fast online task placement on FPGAs: free space partitioning and 2D-hashing , 2003, Proceedings International Parallel and Distributed Processing Symposium.

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