Exploiting loop-level parallelism on coarse-grained reconfigurable architectures using modulo scheduling
Bingfeng Mei, Serge Vernalde, Diederik Verkest et al. · 2003
Coarse-grained reconfigurable architectures have be-come increasingly important in recent years. Automatic design or compilation tools are essential to their success. In this paper, we present a modulo scheduling algorithm to exploit loop-level parallelism for coarse-grained recon-figurable architectures. This algorithm is a key part of our Dynamically Reconfigurable Embedded Systems Com-piler (DRESC). It is capable of solving placement, schedul-ing and routing of operations simultaneously in a modulo-constrained 3D space and uses an abstract architecture rep-resentation to model a wide class of coarse-grained archi-tectures. The experimental results show high performance and efficient resource utilization on tested kernels. 1
Cited by 172 works.
Authors
References
- Architecture and CAD for Deep-Submicron FPGAS
- Software pipelining
- Effective compiler support for predicated execution using the hyperblock
- MorphoSys: an integrated reconfigurable system for data-parallel and computation-intensive applications
- IMPACT
- RaPiD — Reconfigurable pipelined datapath
- Placement and routing tools for the Triptych FPGA
- MATRIX: a reconfigurable computing architecture with configurable instruction distribution and deployable resources
- Iterative Modulo Scheduling
- PipeRench: A virtualized programmable datapath in 0.18 micron technology