Lookahead memory prefetching for cgras using partial loop unrolling

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

Abstract

Coarse Grained Reconfigurable Arrays have become an established approach to provide high computational performance in various environments. Several researchers have found that the achievable performance highly depends on the interface between memory and CGRA. In this contribution we show that a smart prefetching mechanism can increase the performance of the CGRA. At the same time it consumes less hardware resources and energy as state of the art prefetching mechanisms.

Author supplied keywords

Cite

CITATION STYLE

APA

Jung, L. J., & Hochberger, C. (2018). Lookahead memory prefetching for cgras using partial loop unrolling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10824 LNCS, pp. 93–104). Springer Verlag. https://doi.org/10.1007/978-3-319-78890-6_8

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