TY - GEN
T1 - Intelligent merging online task placement algorithm for partial reconflgurable systems
AU - Marconi, Thomas
AU - Lu, Yi
AU - Bertels, Koen
AU - Gaydadjiev, Georgi
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=49749087147&partnerID=8YFLogxK
U2 - 10.1109/DATE.2008.4484866
DO - 10.1109/DATE.2008.4484866
M3 - Conference contribution
AN - SCOPUS:49749087147
SN - 9783981080
SN - 9789783981089
T3 - Proceedings -Design, Automation and Test in Europe, DATE
SP - 1346
EP - 1351
BT - Design, Automation and Test in Europe, DATE 2008
T2 - Design, Automation and Test in Europe, DATE 2008
Y2 - 10 March 2008 through 14 March 2008
ER -