Modulo graph embedding: Mapping applications onto coarse-grained reconfigurable architectures

CASES 2006: International Conference on Compilers, Architecture and Synthesis for Embedded Systems

Volumn , Issue , 2006, Pages 136-146

  Park, Hyunchul ^a   Fan, Kevin ^a   Kudlur, Manjunath ^a   Mahlke, Scott ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Coarse grained reconfigurable architecture; Graph embedding; Modulo scheduling

Indexed keywords

COARSE-GRAINED RECONFIGURABLE ARCHITECTURES (CGRAS); GRAPH EMBEDDING; MODULO SCHEDULING;

ENERGY EFFICIENCY; GRAPH THEORY; PIPELINE PROCESSING SYSTEMS; SCALABILITY; SCHEDULING; THROUGHPUT;

EMBEDDED SYSTEMS;

EID: 34547197349     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1176760.1176778     Document Type: Conference Paper

References (19)

1. T. Callahan, J. Hauser, and J. Wawrzynek. The Garp architecture and C compiler. IEEE Computer, 33(4):62-69, Apr. 2000.
2. R. Davidson and D. Harel. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics, 15(4):301-331, 1996.
3. P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149-160, 1984.
4. C. Ebeling et al. Mapping applications to the RaPiD configurable architecture. In Proc. of the 5th IEEE Symposium on Field-Programmable Custom Computing Machines, pages 106-115, Apr. 1997.
5. J. Ellis. Bulldog: A Compiler for VLIW Architectures. MIT Press, Cambridge, MA, 1985.
6. S. Goldstein et al. PipeRench: A coprocessor for streaming multimedia acceleration. In Proc. of the 26th Annual International Symposium, on Computer Architecture, pages 28-39, June 1999.
7. T. Kamada and S. Kawai. An algorithm, for drawing general undirected graphs. Information Processing Letters, 31:7-15, 1989.
8. G. Krishnamurthy, E. Granston, and E. Stotzer. Affinity-based cluster assignment for unrolled loops. In Proc. of the 2002 International Conference on Supercomputing, pages 107-116, June 2002.
9. J. Lee, K. Choi, and N. Dutt. Compilation approach for coarse-grained reconfigurable architectures. IEEE Design & Test of Computers, 20(1):26-33, Jan. 2003.
10. W. Lee et al. Space-time scheduling of instruction-level parallelism on a RAW machine. In Eighth International Conference on Architectural Support for Programming Languages and Operating Systems, pages 46-57, Oct. 1998.
11. W. Lee, D. Puppin, S. Swenson, and S. Amarasinghe. Convergent scheduling. In Proc. of the 35th Annual International Symposium on Microarchitecture, pages 111-122, 2002.
12. W. Li and H. Kurata. A grid layout algorithm, for automatic drawing of biochemical networks. Bioinformatics, 21(9):2036-2042, 2005.
13. G. Lu, H. Singh, M.-H. Lee, N. Bagherzadeh, F. J. Kurdahi, and E. M. C. Filho. The MorphoSys parallel reconfigurable system. In Proc. of the 5th International Euro-Par Conference, pages 727-734, 1999.
14. B. Mei, S. Vernalde, D. Verkest, H. D. Man, and R. Lauwereins. Exploiting loop-level parallelism on coarse-grained reconfigurable architectures using modulo scheduling. In Proc. of the 2003 Design, Automation and Test in Europe, pages 296-301, 2003.
15. E. Nystrom and A. E. Eichenberger. Effective cluster assignment for modulo scheduling. In Proc. of the 31st Annual International Symposium on Microarchitecture, pages 103-114, Dec. 1998.
16. B. R. Rau. Iterative modulo scheduling: An algorithm for software pipelining loops. In Proc. of the 27th Annual International Symposium on Microarchitecture, pages 63-74, Nov. 1994.
17. J. Sanchez and A. Gonzalez. Modulo scheduling for a fully-distributed clustered VLIW architecture. In Proc. of the 33rd Annual International Symposium on Microarchitecture, pages 124-133, Dec. 2000.
18. M. B. Taylor et al. The Raw microprocessor: A computational fabric for software circuits and general purpose programs. IEEE Micro, 22(2):25-35, 2002.
19. G. Venkataramani, W. Najjar, F. Kurdahi, N. Bagherzadeh, and W. Bohm. A compiler framework for mapping applications to a coarse-grained reconfigurable computer architecture, pages 116-125, 2001.