Abstract

The common objective of very large scale integration (VLSI) placement problem is to minimize the total wirelength, which is calculated by the total half-perimeter wirelength (HPWL). Since the HPWL is not differentiable, various differentiable wirelength approximation functions have been proposed in nonlinear programming placement methods. The VLSI placement problem is NP-hard, and many placement constraints on a chip must be considered. It is a great challenge to design efficient and effective algorithms for the VLSI placement problem, especially for handling designs with millions of objects. In this talk, from the view of mathematics methods, I will try to discuss the characteristics of VLSI placement problem, and introduce some of our work on this problem.

Bio

Dr. Jianli Chen is currently an Associate Professor at the Center for Discrete Mathematics and Theoretical Computer Science, Fuzhou University. He received the B.Sc. degree in information and computing sciences, the M.Sc. degree in computer application technology, and the Ph.D. degree in applied mathematics, all from Fuzhou University, Fuzhou, China, in 2007, 2009, and 2012, respectively. His research interests include optimization theory and applications, and optimization methods for very large scale integration placement. He received Best Paper Award from the International Doctoral Forum on Operations Research and Control Theory in 2011, the first prize in 13^th FuJian Best Paper Award in Natural Sciences (2014), and the Distinguished Young Scholars Foundation of FuJian Educational Committee in 2016.

All faculties and students are welcome to join.