Optimal unroll factor for reconfigurable architectures

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

Abstract

Loops are an important source of optimization. In this paper, we address such optimizations for those cases when loops contain kernels mapped on reconfigurable fabric. We assume the Molen machine organization and Molen programming paradigm as our framework. The proposed algorithm computes the optimal unroll factor u for a loop that contains a hardware kernel K such that u instances of K run in parallel on the reconfigurable hardware, and the targeted balance between performance and resource usage is achieved. The parameters of the algorithm consist of profiling information about the execution times for running K in both hardware and software, the memory transfers and the utilized area. In the experimental part, we illustrate this method by applying it to a loop nest from a real-life application (MPEG2), containing the DCT kernel. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Dragomir, O. S., Moscu-Panainte, E., Bertels, K., & Wong, S. (2008). Optimal unroll factor for reconfigurable architectures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4943 LNCS, pp. 4–14). https://doi.org/10.1007/978-3-540-78610-8_4

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