In this paper we develop compilation techniques for the realization of applications described in a High Level Language (HLL) onto a Runtime Reconfigurable Architecture. The compiler determines Hyper Operations (HyperOps) that are subgraphs of a data flow graph (of an application) and comprise elementary operations that have strong producer-consumer relationship. These HyperOps are hosted on computation structures that are provisioned on demand at runtime. We also report compiler optimizations that collectively reduce the overheads of data-driven computations in runtime reconfigurable architectures. On an average, HyperOps offer a 44% reduction in total execution time and a 18% reduction in management overheads as compared to using basic blocks as coarse grained operations. We show that HyperOps formed using our compiler are suitable to support data flow software pipelining. © Springer-Verlag Berlin Heidelberg 2009.
CITATION STYLE
Alle, M., Varadarajan, K., Fell, A., Nandy, S. K., & Narayan, R. (2009). Compiling techniques for coarse grained runtime reconfigurable architectures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5453, pp. 204–215). https://doi.org/10.1007/978-3-642-00641-8_21
Mendeley helps you to discover research relevant for your work.