Intelligent Merging Online Task Placement Algorithm for Partial Reconfigurable Systems

Thomas Marconi*, Yi Lu, Koen Bertels, Georgi Gaydadjiev

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

25 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationDesign, Automation and Test in Europe, DATE 2008
Number of pages6
ISBN (Print)978-3-9810801-3-1
Publication statusPublished - 25-Aug-2008
Externally publishedYes
EventDesign, Automation and Test in Europe, DATE 2008 - Munich, Germany
Duration: 10-Mar-200814-Mar-2008

Publication series

NameProceedings -Design, Automation and Test in Europe, DATE
ISSN (Print)1530-1591


ConferenceDesign, Automation and Test in Europe, DATE 2008

Cite this