Intelligent Merging Online Task Placement Algorithm for Partial Reconfigurable Systems | IEEE Conference Publication | IEEE Xplore

Intelligent Merging Online Task Placement Algorithm for Partial Reconfigurable Systems


Abstract:

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 t...Show More

Abstract:

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.
Date of Conference: 10-14 March 2008
Date Added to IEEE Xplore: 11 April 2008
ISBN Information:

ISSN Information:

Conference Location: Munich, Germany

Contact IEEE to Subscribe

References

References is not available for this document.