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, the authors propose three techniques: Merging Only if Needed (MON), Partial Merging (PM), and Direct Combine (DC). Their 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.

Provided by: edaa Topic: Hardware Date Added: Mar 2008 Format: PDF

Find By Topic