Dataflow Graph Partitioning for Optimal Spatio-Temporal Computation on a Coarse Grain Reconfigurable Architecture
暂无分享,去创建一个
Masahiro Fujita | S. K. Nandy | Ranjani Narayan | Keshavan Varadarajan | Mythri Alle | Ratna Krishnamoorthy
[1] M E J Newman,et al. Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.
[2] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[3] D. F. Wong,et al. Efficient network flow based min-cut balanced partitioning , 1994, ICCAD 1994.
[4] Reiner W. Hartenstein,et al. A decade of reconfigurable computing: a visionary retrospective , 2001, Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001.
[5] John Wawrzynek,et al. Reconfigurable computing: what, why, and implications for design automation , 1999, DAC '99.
[6] D. B. Davis,et al. Intel Corp. , 1993 .
[7] S. K. Nandy,et al. REDEFINE: Runtime reconfigurable polymorphic ASIC , 2009, TECS.
[8] S. K. Nandy,et al. Compiling Techniques for Coarse Grained Runtime Reconfigurable Architectures , 2009, ARC.
[9] Dinesh Bhatia,et al. Temporal Partitioning and Scheduling Data Flow Graphs for Reconfigurable Computers , 1999, IEEE Trans. Computers.
[10] Bernard Pottier,et al. Guest editorial CAPA'08 configurable computing: Configuring algorithms, processes, and architecture issue I: Configuring algorithms and processes , 2009, TECS.