BFT: a placement algorithm for non-rectangle task model in reconfigurable computing system
Task scheduling and placement drawback is one in all the most significant and time-consuming parts in reconfigurable computing (RC) system. Several investigators have explored on the subject, and most of the ancient studies are concentrated on the rectangle task model, that is inconsistent with objective task shape placed in a very field programmable gate array (FPGA) however simplifies the system complexity. Rectangle task model produces inner fragments which reduces utilisation of reconfigurable resources in an FPGA. During this study, a task model transformation strategy and an innovative best-match transformation (BFT) placement algorithm are proposed for a non-rectangle task model to boost the performance of an RC system in rejection rate and total execution time. In keeping with simulation experiments, BFT algorithm reduced the rejection rate by fifteen% and 7p.c compared with that of the first-match algorithm and the simplest-fit algorithm, respectively. Multi-form placement algorithm and 3D compaction algorithm are also cited to check with the BFT algorithm. The result shows that the BFT algorithm has less total execution time briefly laxity amount and lower rejection rate in giant laxity amount. Compared with 3D compaction algorithm, the proposed algorithm reduced the entire execution time up to ten.seventy ninepercent.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here