Routing-aware application mapping considering steiner points for coarse-grained reconfigurable architecture

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5992 LNCS, Issue , 2010, Pages 231-243

  Lee, Ganghee ^a   Lee, Seokhyun ^a   Choi, Kiyoung ^a   Dutt, Nikil ^b  

^a Seoul National University   (South Korea)

^b Irvine   (United States)

Author keywords

Coarse grained reconfigurable architecture; High level synthesis; Mapping; Routing

Indexed keywords

APPLICATION MAPPING; COARSE GRAINED RECONFIGURABLE ARCHITECTURE; COARSE-GRAINED; HEURISTIC MAPPING; HIGH LEVEL SYNTHESIS; INTEGER LINEAR PROGRAMMING; MAPPING ALGORITHMS; MAPPING PROCESS; MEDIABENCH; OPTIMAL FORMULATION; OPTIMAL SOLUTIONS; PERFORMANCE IMPROVEMENTS; ROUTING RESOURCES; SPANNING TREE; STEINER POINTS;

CAVITY RESONATORS; CONFORMAL MAPPING; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; LINEARIZATION; OPTIMIZATION; TREES (MATHEMATICS);

EMBEDDED SYSTEMS;

EID: 77951261673     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12133-3_22     Document Type: Conference Paper

References (15)

1. Chameleon Systems Inc., http://www.chameleonsystems.com
2. Callahan, T.J., Wawrzynek, J.: Instruction-level parallelism for reconfigurable computing. In: Hartenstein, R.W., Keevallik, A. (eds.) FPL 1998. LNCS, vol. 1482, pp. 248-257. Springer, Heidelberg (1998)
3. Lee, W., Barua, R., Frank, M., Srikrishna, D., Babb, J., Sarkar, V., Amarasinghe, S.P.: Space-time scheduling of instruction level parallelism on a RAW machine. In: Proc. ASPLOSV (1998)
4. Mei, B., Vernalde, S., Verkest, D., Man, H.D., Lauwereins, R.: DRESC: A retargetable compiler for coarse-grained reconfigurable architectures. In: Proc. ICFPT (2002)
5. Toi, T., Nakamura, N., Kato, Y., Awashima, T., Wakabayashi, K., Jing, L.: High-level synthesis challenges and solutions for a dynamically reconfigurable processor. In: Proc. ICCAD (2006)
6. Park, H., Fan, K., Mahlke, S.A., Oh, T., Kim, H., Kim, H.: Edge-centric modulo scheduling for coarse-grained reconfigurable architectures. In: Proc. PACT (2008)
7. Sutter, B.D., Coene, P., Aa, T.V., Mei, B.: Placement-and-routing-based register allocation for coarse-grained reconfigurable arrays. In: Proc. LCTES (2008)
8. Yoon, J., Shrivastava, A., Park, S., Ahn, M., Paek, Y.: A graph drawing based spatial mapping algorithm for coarse-grained reconfigurable architecture. IEEE Trans. Very Large Scale Integration Systems 10 (June 2008)
9. Lee, G., Lee, S., Choi, K.: Automatic mapping of application to coarse-grained reconfigurable architecture based on high-level synthesis techniques. In: Proc. ISOCC (2008)
10. Kim, Y., Kiemb, M., Park, C., Jung, J., Choi, K.: Resource sharing and pipelining in coarse-grained reconfigurable architecture for domain-specific optimization. In: Proc. DATE (2005)
11. Kim, Y., Park, I., Choi, K., Paek, Y.: Power-conscious configuration cache structure and code mapping for coarse-grained reconfigurable architecture. In: Proc. ISLPED (2006)
12. The SUIF compiler system, http://suif.stanford.edu
13. Oliver Shields Jr., C.: Area Efficient Layouts of Binary Trees in Grids, Ph.D thesis, the University of Texas at Dallas, USA (2001)
14. Han, K., Kim, J.: Quantum-inspired evolutionary algorithms with a new termination criterion, Hε gate, and two phase scheme. IEEE Trans. Evolutionary Computation 8 (April 2004)
15. GNU Linear Programming Kit, http://www.gnu.org/software/glpk