Advanced search
1 file | 598.32 KB Add to list

Automatically exploiting regularity in applications to reduce reconfiguration memory requirements

Author
Organization
Abstract
Partial reconfiguration (PR) of FPGAs is a very promising technique. Applications implemented with PR are small\-er and faster than applications that are not reconfigured. However, the overhead emerging from the reconfiguration process can nullify the benefits of PR. Moreover, the lack of automatic tools hinders the widespread use of the PR technique. In previous work, the PR barriers have been tackled by introducing parameterized configurations and a tool flow that exploits these configurations. For regularly structured applications mapped through this tool flow, the memory resources needed to store the parameterized configuration can be significantly reduced when regularity is exploited. In this paper, we propose a front-end to the tool flow that automatically detects regular structures at the HDL level and transfers those regularities into the reconfiguration process. The results show that a reduction factor of 76, 10 and 167 is achieved in the memory resources needed to store the parameterized configuration when the regularity is exploited for an adaptive FIR, a regular expression matcher and a Ternary Content Addressable Memory (TCAM) respectively. The reduction factor will be further increased when applications scale.

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 598.32 KB

Citation

Please use this url to cite or link to this publication:

MLA
Mostafa Mohamed Ahmed Abouelella, Fatma, Karel Bruneel, and Dirk Stroobandt. “Automatically Exploiting Regularity in Applications to Reduce Reconfiguration Memory Requirements.” 2012 22nd International Conference on Field Programmable Logic and Applications (FPL). 2012. Print.
APA
Mostafa Mohamed Ahmed Abouelella, F., Bruneel, K., & Stroobandt, D. (2012). Automatically exploiting regularity in applications to reduce reconfiguration memory requirements. 2012 22nd International Conference on Field Programmable Logic and Applications (FPL). Presented at the 2012 22nd International Conference on Field Programmable Logic and Applications (FPL).
Chicago author-date
Mostafa Mohamed Ahmed Abouelella, Fatma, Karel Bruneel, and Dirk Stroobandt. 2012. “Automatically Exploiting Regularity in Applications to Reduce Reconfiguration Memory Requirements.” In 2012 22nd International Conference on Field Programmable Logic and Applications (FPL).
Chicago author-date (all authors)
Mostafa Mohamed Ahmed Abouelella, Fatma, Karel Bruneel, and Dirk Stroobandt. 2012. “Automatically Exploiting Regularity in Applications to Reduce Reconfiguration Memory Requirements.” In 2012 22nd International Conference on Field Programmable Logic and Applications (FPL).
Vancouver
1.
Mostafa Mohamed Ahmed Abouelella F, Bruneel K, Stroobandt D. Automatically exploiting regularity in applications to reduce reconfiguration memory requirements. 2012 22nd International Conference on Field Programmable Logic and Applications (FPL). 2012.
IEEE
[1]
F. Mostafa Mohamed Ahmed Abouelella, K. Bruneel, and D. Stroobandt, “Automatically exploiting regularity in applications to reduce reconfiguration memory requirements,” in 2012 22nd International Conference on Field Programmable Logic and Applications (FPL), Oslo, Norway, 2012.
@inproceedings{3226386,
  abstract     = {Partial reconfiguration (PR) of FPGAs is a very promising technique. Applications implemented with PR are small\-er and faster than applications that are not reconfigured. However, the overhead emerging from the reconfiguration process can nullify the benefits of PR. Moreover, the lack of automatic tools hinders the widespread use of the PR technique. In previous work, the PR barriers have been tackled by introducing parameterized configurations and a tool flow that exploits these configurations. For regularly structured applications mapped through this tool flow, the memory resources needed to store the parameterized configuration can be significantly reduced when regularity is exploited. In this paper, we propose a front-end to the tool flow that automatically detects regular structures at the HDL level and transfers those regularities into the reconfiguration process. The results show that a reduction factor of 76, 10 and 167 is achieved in the memory resources needed to store the parameterized configuration when the regularity is exploited for an adaptive FIR, a regular expression matcher and a Ternary Content Addressable Memory (TCAM) respectively. The reduction factor will be further increased when applications scale.},
  author       = {Mostafa Mohamed Ahmed Abouelella, Fatma and Bruneel, Karel and Stroobandt, Dirk},
  booktitle    = {2012 22nd International Conference on Field Programmable Logic and Applications (FPL)},
  language     = {eng},
  location     = {Oslo, Norway},
  pages        = {8},
  title        = {Automatically exploiting regularity in applications to reduce reconfiguration memory requirements},
  year         = {2012},
}