The Community for Technology Leaders
RSS Icon
Issue No.03 - May/June (2010 vol.27)
pp: 62-74
Robert Brayton , University of California, Berkeley
Jason Cong , University of California, Los Angeles
<p>The July 2009 National Science Foundation workshop on EDA had two objectives: First, to reflect on EDA's success and to see if EDA practices can influence other fields of computer science and if EDA methodology can be applied to other application domains; and second, to review the progress made under the National Design Initiative and evaluate what new directions and topics should be added to the Initiative. This two-part report, part 1 of which appeared in the March/April issue, contains an overview of EDA, its funding history, a discussion of major challenges, related emerging technologies, and a look at how EDA experience might help in developing these technologies, along with associated educational aspects and challenges. The report also considers EDA's relation with computer science theorists and how this collaboration can be revived. Finally, the report presents three sets of recommendations on how to promote EDA and assist with the serious challenges it faces in the future.</p>
design and test, design automation, EDA
Robert Brayton, Jason Cong, "NSF Workshop on EDA: Past, Present, and Future (Part 2)", IEEE Design & Test of Computers, vol.27, no. 3, pp. 62-74, May/June 2010, doi:10.1109/MDT.2010.70
1. R. Brayton and J. Cong, "NSF Workshop on EDA: Past, Present, and Future (Part 1)," IEEE Design & Test, vol. 27, no. 2, 2010, pp. 68-74.
2. A. Korkin and F. Rosei eds., , Nanoelectronics and Photonics: From Atoms to Materials, Devices, and Architectures, Springer, 2008.
3. FlexTech Alliance; http:/
4. T.-C. Huang and K.-T. Cheng, "Design for Low Power and Reliable Flexible Electronics: Self-Tunable Cell- Library Design," IEEE/OSA J. Display Technology, vol. 5, no. 6, 2009, pp. 206-215.
5. J.R. Larus et al., "Righting Software," IEEE Software, vol. 21, no. 3, 2004, pp. 92-100.
6. M. Frigo et al., "Cache-Oblivious Algorithms," Proc. 40th IEEE Symp. Foundations of Computer Science (FOCS 99), IEEE CS Press, 1999, pp. 285-297.
7. L. Arge et al., "An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms," SIAM J. Computing, vol. 36, no. 6, 2007, pp. 1672-1695.
8. R. Chowdhury and V. Ramachandran, "The Cache- Oblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental Evaluation," Proc. ACM Symp. Parallelism in Algorithms and Architectures (SPAA 07), ACM Press, 2007, pp. 71-80.
9. R. Chowdhury and V. Ramachandran, "Cache-Efficient Dynamic Programming Algorithms for Multicores," Proc. ACM Symp. Parallelism in Algorithms and Architectures (SPAA 08), ACM Press, 2008, pp. 207-216.
10. L.G. Valiant, "A Bridging Model for Multi-Core Computing," Proc. 16th European Symp. Algorithms (ESA 08), LNCS 5193, Springer-Verlag, 2008, pp. 13-28.
11. J. Holm, K. de Lichtenberg, and M. Thorup, "Poly- Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity," J.ACM, vol. 48, 2001, pp. 723-760.
12. C. Demetrescu and G.F. Italiano, "A New Approach to Dynamic All Pairs Shortest Paths," JACM, vol. 51, 2004, pp. 968-992.
25 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool