Interprocedural optimization for dynamic hardware configurations

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Little research in compiler optimizations has been undertaken to eliminate or diminish the negative influence on performance of the huge reconfiguration latency of the available FPGA platforms. In this paper, we propose an interprocedural optimization that minimizes the number of executed hardware configuration instructions taking into account constraints such as the "FPGA-area placement conflicts" between the available hardware configurations. The proposed algorithm allows the anticipation of hardware configuration instructions up to the application's main procedure. The presented results show that our optimization produces a reduction of up to 3 - 5 order of magnitude of the number of executed hardware configuration instructions. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Panainte, E. M., Bertels, K., & Vassiliadis, S. (2005). Interprocedural optimization for dynamic hardware configurations. In Lecture Notes in Computer Science (Vol. 3553, pp. 2–11). Springer Verlag. https://doi.org/10.1007/11512622_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free