BFT: a placement algorithm for non-rectangle task model in reconfigurable computing system

Task scheduling and placement problem is one of the most significant and time-consuming parts in reconfigurable computing (RC) system. Many investigators have explored on the subject, and most of the traditional studies are concentrated on the rectangle task model, which is inconsistent with objecti...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Chronic diseases and translational medicine Jg. 10; H. 3; S. 128 - 137
Hauptverfasser: Wang, Chaohui, Wu, Weiguo, Nie, Shiqiang, Qian, Depei
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Beijing The Institution of Engineering and Technology 01.05.2016
John Wiley & Sons, Inc
Schlagworte:
3D compaction algorithm
Algorithms
BFT
Communication
Computer simulation
field programmable gate array
Field programmable gate arrays
first‐fit algorithm
FPGA
innovative best‐fit transformation placement algorithm
multishape placement algorithm
nonrectangle task model
Placement
processor scheduling
RC system
reconfigurable architectures
reconfigurable computing system
reconfigurable resources
Rectangles
Rejection rate
Resource management
Scheduling
system complexity
task model transformation strategy
task scheduling and placement problem
Tasks
total execution time
Transformations
RC system
field programmable gate arrays
FPGA
task scheduling and placement problem
processor scheduling
BFT
reconfigurable resources
multishape placement algorithm
3D compaction algorithm
reconfigurable computing system
reconfigurable architectures
system complexity
rejection rate
field programmable gate array
innovative best-fit transformation placement algorithm
total execution time
nonrectangle task model
task model transformation strategy
first-fit algorithm
ISSN:1751-8601, 1751-861X, 2095-882X, 1751-861X, 2589-0514
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Task scheduling and placement problem is one of the most significant and time-consuming parts in reconfigurable computing (RC) system. Many investigators have explored on the subject, and most of the traditional studies are concentrated on the rectangle task model, which is inconsistent with objective task shape placed in a field programmable gate array (FPGA) but simplifies the system complexity. Rectangle task model produces inner fragments which reduces utilisation of reconfigurable resources in an FPGA. In this study, a task model transformation strategy and an innovative best-fit transformation (BFT) placement algorithm are proposed for a non-rectangle task model to improve the performance of an RC system in rejection rate and total execution time. According to simulation experiments, BFT algorithm reduced the rejection rate by 15% and 7% compared with that of the first-fit algorithm and the best-fit algorithm, respectively. Multi-shape placement algorithm and 3D compaction algorithm are also cited to compare with the BFT algorithm. The result shows that the BFT algorithm has less total execution time in short laxity period and lower rejection rate in large laxity period. Compared with 3D compaction algorithm, the proposed algorithm reduced the total execution time up to 10.79%.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1751-8601
1751-861X
2095-882X
1751-861X
2589-0514
DOI:10.1049/iet-cdt.2015.0095