Mapping Loops onto Coarse-Grained Reconfigurable Array Using Genetic Algorithm
暂无分享,去创建一个
[1] Scott A. Mahlke,et al. Edge-centric modulo scheduling for coarse-grained reconfigurable architectures , 2008, 2008 International Conference on Parallel Architectures and Compilation Techniques (PACT).
[2] Rudy Lauwereins,et al. DRESC: a retargetable compiler for coarse-grained reconfigurable architectures , 2002, 2002 IEEE International Conference on Field-Programmable Technology, 2002. (FPT). Proceedings..
[3] Shawki Areibi,et al. A comparison of hardware acceleration methods for VLSI Maze routing , 2009, 2009 IEEE Toronto International Conference Science and Technology for Humanity (TIC-STH).
[4] Ivan Hal Sudborough,et al. Area efficient layouts of binary trees in grids , 2001 .
[5] Yu-Chin Hsu,et al. A formal approach to the scheduling problem in high level synthesis , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[6] Bertil Svensson,et al. Evolution in architectures and programming methodologies of coarse-grained reconfigurable computing , 2009, Microprocess. Microsystems.
[7] Thomas Bäck,et al. Evolutionary computation: comments on the history and current state , 1997, IEEE Trans. Evol. Comput..
[8] B. Ramakrishna Rau,et al. Iterative modulo scheduling: an algorithm for software pipelining loops , 1994, MICRO 27.