Hu Wins Best Paper Award

 

The Lagrangian subproblem is modeled as a graph problem, with proposed algorithms to solve it. In the experiments, the importance of using the signoff timing engine to guide the optimization was demonstrated and the benefit of the graph model proposed to solve the discrete optimization problem was shown. Compared to a state-of-the art industrial optimization flow, their algorithms can obtain up to 38 percent leakage power reductions and better overall timing for real high-performance microprocessor blocks. Hu spent his faculty development leave at the Intel Strategic CAD Laboratories during the fall of 2010 with Ozdal and Burns in the working on this research.

Hu received the B.S. degree in optical engineering from Zhejiang University (China) in 1990, the M.S. degree in physics in 1997 and the Ph.D. degree in electrical engineering from the University of Minnesota in 2001. He worked with IBM Microelectronics from January 2001 to June 2002. [Read more…]