A graph covering algorithm for a coarse grain reconfigurable system

ACM SIGPLAN Notices

Volumn 38, Issue 7, 2003, Pages 199-208

  Guo, Yuanqing ^a   Smit, Gerard J M ^a   Broersma, Hajo ^a   Heysters, Paul M ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Compiler; Reconfigurable system; Template generation

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTER ARCHITECTURE; DATA STRUCTURES; GRAPH THEORY; MICROPROGRAMMING; PROGRAM COMPILERS;

COARSE GRAIN RECONFIGURABLE SYSTEM; GRAPH COVERING ALGORITHM; TEMPLATE GENERATION;

ALGORITHMS;

EID: 1442337754     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/780731.780760     Document Type: Conference Paper

References (16)

1. Instruction generation for hybrid reconfigurable systems. http://citeseer.nj.nec.com/446997.html.
2. Srinivasa R. Arikati and Ravi Varadarajan. A signature based approach to regularity extraction. In Proceedings of International Conference on Computer-Aided Design (ICCAD), pages 542-545, 1997.
3. Marnix Arnold and Henk Corporaal. Automatic detection of recurring operation patterns. In Proceedings of the seventh International Workshop on Hardware/software Codesign, pages 22-26, Rome, Italy, March 1999.
4. Srihari Cadambi and Seth Copen Goldstein. Cpr: A configuration profiling tool. In Proceedings of IEEE Symposium on FPGAs for Custom Computing Machines, 1999.
5. Timothy J. Callahan, Philip Chong, Andre DeHon, and John Wawrzynek. Fast module mapping and placement for datapaths in fpgas. In Proceedings of International Symposium of Field Programmable Gate Arrays, 1998.
6. Amit Chowdhary, Sudhakar Kale, Phani Saripella, Naresh Sehgal, and Rajesh Gupta. A general approach for regularity extraction in datapath circuits. In Proceedings of International Conference on Computer-Aided Design (ICCAD), pages 332-339, 1998.
7. Miguel R. Corazao, Marwan A. Khalaf, Lisa M.Guerra, Miodrag Potkonjak, and Jan M. Rabaey. Performance optimization using template mapping for datapath-intensive high-level synthesis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 15(8):877-888, August 1996.
8. C. Ebeling and O. Zajicek. Validating vlsi circuit layout by wirelist comparison. In Proceedings of Internaltional Conference on Computer-Aided Design (ICCAD), pages 172-173, 1983.
9. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.
10. Yuanqing Guo, Gerard J.M. Smith, and Paul M. Heysters. Template generation and selection algorithms for high level synthesis. accepted for publication in the 3rd IEEE International Workshop on System-on-Chip for Real-Time Applications, 2003.
11. Magnús M. Halldórsson and Jaikumar Radhakrishnan. Greed is good: Approximating independent sets in sparse and bounded-degreegraphs. In Proceedings of ACM Symposium on the Theory of Computing, 1994.
12. Ryan Kastner, Seda Ogrenci-Memik, Elaheh Bozorgzadeh, and Majid Sarrafzadeh. Instruction generation for hybrid reconfigurable systems. In Proceedings of International Conference on Computer-Aided Design (ICCAD), 2001.
13. Thomas Kutzschebauch. Efficient logic optimization using regularity extraction. In Proceedings of International Workshop on Logic Synthesis, 1999.
14. D. Sreenivasa Rao and Fadi J. Kurdahi. On clustering for maximal regularity extraction. IEEE Transactions on Computer-Aided Design, 12(8):1198-1208, August 1993.
15. Michel A.J. Rosien, Yuanqing Guo, Gerard J.M. Smit, and Thijs Krol. Mapping applications to an fpfa tile. In Proceedings of Design, Automation and Test in Europe, March 2003.
16. Gerard J.M. Smit, Paul J.M. Havinga, Logewijk T. Smit, Paul M. Heysters, and Michel A.J. Rosien. Dynamic reconfiguration in mobile systems. In Proceedings of FPL2002, pages 171-181, September 2002.