Register Allocation and Binding for Low Power
暂无分享,去创建一个
[1] Daniel Gajski,et al. Design Tools for Intelligent Silicon Compilation , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[2] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[3] Daniel P. Siewiorek,et al. Automated Synthesis of Data Paths in Digital Systems , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[4] Fadi J. Kurdahi,et al. REAL: A Program for REgister ALlocation , 1987, 24th ACM/IEEE Design Automation Conference.
[5] Peter Duzy,et al. The Synthesis Approach to Digital System Design , 1992 .
[6] W. A. Ericson. Introduction to Mathematical Statistics, 4th Edition , 1972 .
[7] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[8] Athanasios Papoulis,et al. Probability, Random Variables and Stochastic Processes , 1965 .
[9] Peter Marwedel,et al. Integrated Scheduling and Binding : A Synthesis Approach for Design Space Exploration , 1989, 26th ACM/IEEE Design Automation Conference.
[10] Herbert S. Wilf,et al. Algorithms and Complexity , 1994, Lecture Notes in Computer Science.
[11] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[12] Donald E. Thomas,et al. A Method of Automatic Data Path Synthesis , 1983, 20th Design Automation Conference Proceedings.
[13] Pierre G. Paulin,et al. Scheduling and Binding Algorithms for High-Level Synthesis , 1989, 26th ACM/IEEE Design Automation Conference.
[14] M. Golummc. Algorithmic graph theory and perfect graphs , 1980 .
[15] Giovanni De Micheli,et al. Relative scheduling under timing constraints , 1991, DAC '90.
[16] Giovanni De Micheli,et al. Synthesis and Optimization of Digital Circuits , 1994 .