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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Chronic diseases and translational medicine Ročník 10; číslo 3; s. 128 - 137
Hlavní autori:	Wang, Chaohui, Wu, Weiguo, Nie, Shiqiang, Qian, Depei
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Beijing The Institution of Engineering and Technology 01.05.2016 John Wiley & Sons, Inc
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!