Efficient region allocation for adaptive partial reconfiguration

Kizheppatt Vipin, Suhaib A. Fahmy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

Abstract

While partial reconfiguration on FPGAs has attracted significant research interest in recent years, designing systems that leverage it remains a specialist skill. Systems with a large number of reconfigurable modules can be challenging to design. Deciding on how many reconfigurable regions to use is not always straightforward, yet this choice impacts area efficiency and configuration latency. Current FPGA partial reconfiguration tool flows require the designer to have detailed knowledge of the physical architecture of the FPGA. It is the responsibility of the designer to decide on the location and size of regions. In this paper we introduce a formulation for determining the tradeoff between the number of reconfigurable regions, the allocation of modules to regions, and the reconfiguration overhead, represented by area and reconfiguration time. Throughout the investigation, we consider the heterogeneous nature of modern FPGAs as well as limitations imposed by current tools. We then show that adopting an optimal allocation can result in both area savings and a reduction in reconfiguration time over a standard approach to allocation.

Original languageEnglish
Title of host publication2011 International Conference on Field-Programmable Technology, FPT 2011
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event2011 International Conference on Field-Programmable Technology, FPT 2011 - New Delhi, India
Duration: Dec 12 2011Dec 14 2011

Conference

Conference2011 International Conference on Field-Programmable Technology, FPT 2011
CountryIndia
CityNew Delhi
Period12/12/1112/14/11

Fingerprint

Reconfiguration
Field programmable gate arrays (FPGA)
Field Programmable Gate Array
Partial
Module
Optimal Allocation
Leverage
Latency
Trade-offs
Configuration
Formulation

ASJC Scopus subject areas

  • Computational Mathematics

Cite this

Vipin, K., & Fahmy, S. A. (2011). Efficient region allocation for adaptive partial reconfiguration. In 2011 International Conference on Field-Programmable Technology, FPT 2011 [6133248] https://doi.org/10.1109/FPT.2011.6133248

Efficient region allocation for adaptive partial reconfiguration. / Vipin, Kizheppatt; Fahmy, Suhaib A.

2011 International Conference on Field-Programmable Technology, FPT 2011. 2011. 6133248.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Vipin, K & Fahmy, SA 2011, Efficient region allocation for adaptive partial reconfiguration. in 2011 International Conference on Field-Programmable Technology, FPT 2011., 6133248, 2011 International Conference on Field-Programmable Technology, FPT 2011, New Delhi, India, 12/12/11. https://doi.org/10.1109/FPT.2011.6133248
Vipin K, Fahmy SA. Efficient region allocation for adaptive partial reconfiguration. In 2011 International Conference on Field-Programmable Technology, FPT 2011. 2011. 6133248 https://doi.org/10.1109/FPT.2011.6133248
Vipin, Kizheppatt ; Fahmy, Suhaib A. / Efficient region allocation for adaptive partial reconfiguration. 2011 International Conference on Field-Programmable Technology, FPT 2011. 2011.
@inproceedings{ee0badc7aec14dc990537bfbd220fc40,
title = "Efficient region allocation for adaptive partial reconfiguration",
abstract = "While partial reconfiguration on FPGAs has attracted significant research interest in recent years, designing systems that leverage it remains a specialist skill. Systems with a large number of reconfigurable modules can be challenging to design. Deciding on how many reconfigurable regions to use is not always straightforward, yet this choice impacts area efficiency and configuration latency. Current FPGA partial reconfiguration tool flows require the designer to have detailed knowledge of the physical architecture of the FPGA. It is the responsibility of the designer to decide on the location and size of regions. In this paper we introduce a formulation for determining the tradeoff between the number of reconfigurable regions, the allocation of modules to regions, and the reconfiguration overhead, represented by area and reconfiguration time. Throughout the investigation, we consider the heterogeneous nature of modern FPGAs as well as limitations imposed by current tools. We then show that adopting an optimal allocation can result in both area savings and a reduction in reconfiguration time over a standard approach to allocation.",
author = "Kizheppatt Vipin and Fahmy, {Suhaib A.}",
year = "2011",
doi = "10.1109/FPT.2011.6133248",
language = "English",
isbn = "9781457717406",
booktitle = "2011 International Conference on Field-Programmable Technology, FPT 2011",

}

TY - GEN

T1 - Efficient region allocation for adaptive partial reconfiguration

AU - Vipin, Kizheppatt

AU - Fahmy, Suhaib A.

PY - 2011

Y1 - 2011

N2 - While partial reconfiguration on FPGAs has attracted significant research interest in recent years, designing systems that leverage it remains a specialist skill. Systems with a large number of reconfigurable modules can be challenging to design. Deciding on how many reconfigurable regions to use is not always straightforward, yet this choice impacts area efficiency and configuration latency. Current FPGA partial reconfiguration tool flows require the designer to have detailed knowledge of the physical architecture of the FPGA. It is the responsibility of the designer to decide on the location and size of regions. In this paper we introduce a formulation for determining the tradeoff between the number of reconfigurable regions, the allocation of modules to regions, and the reconfiguration overhead, represented by area and reconfiguration time. Throughout the investigation, we consider the heterogeneous nature of modern FPGAs as well as limitations imposed by current tools. We then show that adopting an optimal allocation can result in both area savings and a reduction in reconfiguration time over a standard approach to allocation.

AB - While partial reconfiguration on FPGAs has attracted significant research interest in recent years, designing systems that leverage it remains a specialist skill. Systems with a large number of reconfigurable modules can be challenging to design. Deciding on how many reconfigurable regions to use is not always straightforward, yet this choice impacts area efficiency and configuration latency. Current FPGA partial reconfiguration tool flows require the designer to have detailed knowledge of the physical architecture of the FPGA. It is the responsibility of the designer to decide on the location and size of regions. In this paper we introduce a formulation for determining the tradeoff between the number of reconfigurable regions, the allocation of modules to regions, and the reconfiguration overhead, represented by area and reconfiguration time. Throughout the investigation, we consider the heterogeneous nature of modern FPGAs as well as limitations imposed by current tools. We then show that adopting an optimal allocation can result in both area savings and a reduction in reconfiguration time over a standard approach to allocation.

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

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

U2 - 10.1109/FPT.2011.6133248

DO - 10.1109/FPT.2011.6133248

M3 - Conference contribution

SN - 9781457717406

BT - 2011 International Conference on Field-Programmable Technology, FPT 2011

ER -