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

Tieyuan Pan, Lian Zeng, Yasuhiro Takashima, Takahiro Watanabe

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)2412-2424
Number of pages13
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE99A
Issue number12
DOIs
Publication statusPublished - 2016 Dec 1

Fingerprint

Rectangle
Enumeration
Field Programmable Gate Array
Placement
Field programmable gate arrays (FPGA)
Space Complexity
Free Space
Time Complexity
Assignment
Data storage equipment
Resources
Series
Processing
Experiment
Experiments

Keywords

  • Fast MER enumeration
  • FPGAs
  • Low memory consumption

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

A fast MER enumeration algorithm for online task placement on reconfigurable FPGAs. / Pan, Tieyuan; Zeng, Lian; Takashima, Yasuhiro; Watanabe, Takahiro.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E99A, No. 12, 01.12.2016, p. 2412-2424.

Research output: Contribution to journalArticle

@article{da08872732e64ff48a301ddced301636,
title = "A fast MER enumeration algorithm for online task placement on reconfigurable FPGAs",
abstract = "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.",
keywords = "Fast MER enumeration, FPGAs, Low memory consumption",
author = "Tieyuan Pan and Lian Zeng and Yasuhiro Takashima and Takahiro Watanabe",
year = "2016",
month = "12",
day = "1",
doi = "10.1587/transfun.E99.A.2412",
language = "English",
volume = "E99A",
pages = "2412--2424",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "12",

}

TY - JOUR

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

AU - Pan, Tieyuan

AU - Zeng, Lian

AU - Takashima, Yasuhiro

AU - Watanabe, Takahiro

PY - 2016/12/1

Y1 - 2016/12/1

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

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

KW - Fast MER enumeration

KW - FPGAs

KW - Low memory consumption

UR - http://www.scopus.com/inward/record.url?scp=84999289144&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84999289144&partnerID=8YFLogxK

U2 - 10.1587/transfun.E99.A.2412

DO - 10.1587/transfun.E99.A.2412

M3 - Article

VL - E99A

SP - 2412

EP - 2424

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 12

ER -