SPKM : A novel graph drawing based algorithm for application mapping onto Coarse-grained reconfigurable architectures

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Volumn , Issue , 2008, Pages 776-782

  Yoon, Jonghee W ^a   Shrivastava, Aviral ^b   Park, Sanghyun ^a   Ahn, Minwook ^a   Jeyapaul, Reiley ^b   Paek, Yunheung ^b  

^a Seoul National University   (South Korea)

^b ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTER AIDED DESIGN; DIGITAL INTEGRATED CIRCUITS; DRAWING (GRAPHICS); EMBEDDED SYSTEMS; GRAPH THEORY; INDUSTRIAL ENGINEERING; MAPS; PROGRAM COMPILERS;

APPLICATION MAPPING; COARSE-GRAINED RECONFIGURABLE ARCHITECTURES; DESIGN AUTOMATION CONFERENCE; GRAPH DRAWING; GRAPH MAPPING; IMPRESSIVE PERFORMANCE; MAPPING APPLICATIONS; SOUTH PACIFIC;

CONFORMAL MAPPING;

EID: 49549092193     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASPDAC.2008.4484056     Document Type: Conference Paper

References (11)

1. 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.
2. G. D. Battista, M. Patrignani, and F. Vargiu. A splitpush approach to 3d orthogonal drawing. In Graph Drawing, pages 87-101, 1998.
3. J. Charles Oliver Shields. Area efficient layouts of binary trees in grids. PhD thesis, 2001. Supervisor-Ivan Hal Sudborough.
4. F. Hannig, H. Dutta, and J. Teich. Mapping of regular nested loop programs to coarse-grained reconfigurable arrays - constraints and methodology. In IPDPS 2004: In Proceedings of the 18th International Parallel and Distributed Processing Symposium, Washington, DC, USA, 2004. IEE Computer Society.
5. 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, Piscataway, NJ, USA, 2001. IEEE Press.
6. Y. Kim, M. Kiemb, C. Park, J. Jung, and K. Choi. Resource sharing and pipelining in coarse-grained reconfigurable architecture for domain- specific optimization. In DATE '05: Proceedings of the conference on Design, Automation and Test in Europe, pages 12-17, Washington, DC, USA, 2005. IEEE Computer Society.
7. J. Lee, K. Choi, and N. Dutt. Mapping loops on coarse-grain reconfigurable architectures using memory operation sharing, 2002.
8. B. Mei, S. Vernalde, D. Verkest, H. Man, and R. Lauwereins. Dresc: A retargetable compiler for coarse-grained reconfigurable architectures, in international conference on field programmable technology, 2002., 2002.
9. 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 Press.
10. M. Patrignani and M. Pizzonia. The complexity of the matching-cut problem. In WG '01: Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, pages 284-295, London, UK, 2001. Springer-Verlag.
11. G. Venkataramani, W. Najjar, F. Kurdahi, N. Bagherzadeh, and W. Bohm. A compiler framework for mapping applications to a coarse-grained reconfigurable computer architecture. In CASES '01: Proceedings of the 2001 international conference on Compilers, architecture, and synthesis for embedded systems, pages 116-125, New York, NY, USA, 2001. ACM Press.