A fast MER enumeration algorithm for online task placement on reconfigurable FPGAs

Tieyuan Pan, Lian Zeng, Yasuhiro Takashima, Takahiro Watanabe

研究成果: Article査読

5 被引用数 (Scopus)

抄録

In this paper, we propose a fast Maximal Empty Rectangle (MER) enumeration algorithm for online task placement on reconfigurable Field-Programmable Gate Arrays (FPGAs). On the assumption that each task utilizes rectangle-shaped resources, the proposed algorithm can manage the free space on FPGAs by an MER list. When assigning or removing a task, a series of MERs are selected and cut into segments according to the task and its assignment location. By processing these segments, the MER list can be updated quickly with low memory consumption. Under the proof of the upper limit of the number of the MERs on the FPGA, we analyze both the time and space complexity of the proposed algorithm. The efficiency of the proposed algorithm is verified by experiments.

本文言語English
ページ(範囲)2412-2424
ページ数13
ジャーナルIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
E99A
12
DOI
出版ステータスPublished - 2016 12 1

ASJC Scopus subject areas

  • 信号処理
  • コンピュータ グラフィックスおよびコンピュータ支援設計
  • 応用数学
  • 電子工学および電気工学

フィンガープリント

「A fast MER enumeration algorithm for online task placement on reconfigurable FPGAs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル