Abstract
In high-end embedded systems, coarse-grained reconfigurable architectures (CGRA) continue to replace traditional ASIC designs. CGRAs offer high performance at a low power consumption, yet provide flexibility through programmability. In this paper we introduce a recurrence cycle-aware scheduling technique for CGRAs. Our modulo scheduler groups operations belonging to a recurrence cycle into a clustered node and then computes a scheduling order for those clustered nodes. Deadlocks that arise when two or more recurrence cycles depend on each other are resolved by using heuristics that favor recurrence cycles with long recurrence delays. While with previous work one had to sacrifice either a fast compilation speed in order to get good quality results, or vice versa, this is not necessary anymore with the proposed recurrence cycle-aware scheduling technique. We have implemented the proposed method into our in-house CGRA chip and compiler solution and show that the technique achieves better quality schedules than schedulers based on simulated annealing at a 170-fold speed increase.
- M. Ahn, J. W. Yoon, Y. Paek, Y. Kim, M. Kiemb, and K. Choi. A spatial mapping algorithm for heterogeneous coarse-grained reconfigurable architectures. In DATE '06: Proceedings of the conference on Design, automation and test in Europe, pages 363--368, 3001 Leuven, Belgium, Belgium, 2006. European Design and Automation Association. Google Scholar
Digital Library
- N. Bansal, S. Gupta, N. Dutt, A. Nicolau, and R. Gupta. Interconnectaware mapping of applications to coarse-grain reconfigurable architectures. Lecture Notes in Computer Science, 3203:891--899, 2004.Google Scholar
Cross Ref
- J. C. Dehnert and R. A. Towle. Compiling for the cydra 5. The Journal of Supercomputing, 7(1--2):181--227, 1993. Google Scholar
Digital Library
- C. Ebeling, D. C. Cronquist, P. Franklin, J. Secosky, and S. G. Berg. Mapping applications to the rapid configurable architecture. In FCCM'97: Proceedings of the 5th IEEE Symposium on FPGA-Based Custom Computing Machines, page 106, Washington, DC, USA, 1997. IEEE Computer Society. Google Scholar
Digital Library
- S. Goldstein, H. Schmit, M. Moe, M. Bidu, S. Cadambi, R. Taylor, and R. Laufer. Piperench: a coprocessor for streaming multimedia acceleration. In Proceedings of the 26th International Symposium on Computer Architecture, pages 28--39, Washington, DC, USA, 1999. IEEE Computer Society. Google Scholar
Digital Library
- R. Hartenstein. A decade of reconfigurable computing: a visionary retrospective. In DATE '01: Proceedings of the conference on Design, Automation and Test in Europe, pages 642--649, Washington, DC, USA, 2001. IEEE Computer Society. Google Scholar
Digital Library
- A. Hatanaka and N. Bagherzadeh. A modulo scheduling algorithm for a coarse-grain reconfigurable array template. In Parallel and Distributed Processing Symposium, pages 1--8, Washington, DC, USA, 2007. IEEE Computer Society.Google Scholar
Cross Ref
- J.-e. Lee, K. Choi, and N. D. Dutt. Compilation approach for coarsegrained reconfigurable architectures. IEEE Design & Test of Computers, 20(1):26--33, 2003. Google Scholar
Digital Library
- J. Llosa. Swing modulo scheduling: A lifetime-sensitive approach. In PACT '96: Proceedings of the 1996 Conference on Parallel Architectures and Compilation Techniques, page 80, Washington, DC, USA, 1996. IEEE Computer Society. Google Scholar
Digital Library
- G. Lu, H. Singh, M.-H. Lee, N. Bagherzadeh, F. J. Kurdahi, and E. M. C. Filho. The morphosys parallel reconfigurable system. In Euro-Par '99: Proceedings of the 5th International Euro-Par Conference on Parallel Processing, pages 727--734, London, UK, 1999. Springer-Verlag. Google Scholar
Digital Library
- B. Mei, S. Vernalde, D. Verkest, H. De Man, and R. Lauwereins. Exploiting loop-level parallelism on coarse-grained reconfigurable architectures using modulo scheduling. In DATE '03: Proceedings of the conference on Design, Automation and Test in Europe, page 10296, Washington, DC, USA, 2003. IEEE Computer Society. Google Scholar
Digital Library
- B. Mei, S. Vernalde, D. Verkest, and R. Lauwereins. Design methodology for a tightly coupled vliw/reconfigurable matrix architecture: A case study. In DATE '04: Proceedings of the conference on Design, automation and test in Europe, page 21224, Washington, DC, USA, 2004. IEEE Computer Society. Google Scholar
Digital Library
- H. Park, K. Fan, M. Kudlur, and S. Mahlke. Modulo graph embedding: mapping applications onto coarse-grained reconfigurable architectures. In CASES '06: Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems, pages 136--146, New York, NY, USA, 2006. ACM. Google Scholar
Digital Library
- H. Park, K. Fan, S. A. Mahlke, T. Oh, H. Kim, and H.-s. Kim. Edgecentric modulo scheduling for coarse-grained reconfigurable architectures. In PACT '08: Proceedings of the 17th international conference on Parallel architectures and compilation techniques, pages 166--176, New York, NY, USA, 2008. ACM. Google Scholar
Digital Library
- B. R. Rau. Iterative modulo scheduling: an algorithm for software pipelining loops. In MICRO 27: Proceedings of the 27th annual international symposium on Microarchitecture, pages 63--74, New York, NY, USA, 1994. ACM. Google Scholar
Digital Library
- J.W. Yoon, A. Shrivastava, S. Park, M. Ahn, R. Jeyapaul, and Y. Paek. Spkm: a novel graph drawing based algorithm for application mapping onto coarse-grained reconfigurable architectures. In ASP-DAC '08: Proceedings of the 2008 conference on Asia and South Pacific design automation, pages 776--782, Los Alamitos, CA, USA, 2008. IEEE Computer Society Press. Google Scholar
Digital Library
Index Terms
Recurrence cycle aware modulo scheduling for coarse-grained reconfigurable architectures
Recommendations
Recurrence cycle aware modulo scheduling for coarse-grained reconfigurable architectures
LCTES '09: Proceedings of the 2009 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systemsIn high-end embedded systems, coarse-grained reconfigurable architectures (CGRA) continue to replace traditional ASIC designs. CGRAs offer high performance at a low power consumption, yet provide flexibility through programmability. In this paper we ...
Edge-centric modulo scheduling for coarse-grained reconfigurable architectures
PACT '08: Proceedings of the 17th international conference on Parallel architectures and compilation techniquesCoarse-grained reconfigurable architectures (CGRAs) present an appealing hardware platform by providing the potential for high computation throughput, scalability, low cost, and energy efficiency. CGRAs consist of an array of function units and register ...
Combining Rewriting-Logic, Architecture Generation, and Simulation to Exploit Coarse-Grained Reconfigurable Architectures
FCCM '08: Proceedings of the 2008 16th International Symposium on Field-Programmable Custom Computing MachinesIn recent years, many coarse-grained reconfigurable architectures have been proposed as programmable accelerators for general purpose processors. The processing elements (PEs) of such architectures mainly differ on the computations they can directly ...







Comments