Intelligent merging online task placement algorithm for partial reconflgurable systems

Conference paper (2008)

Authors

T. Marconi Computer Engineering - EEMCS
K.L.M. Bertels (OLD)Quantum Computer Architectures
G. Gaydadjiev Computer Engineering - EEMCS
Research Group
Computer Engineering (EEMCS) (TU Delft)
More Info
expand_more

Published Date

2008

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Quantum & Computer Engineering

Research Group

Computer Engineering

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.