Mohammad Alian, Seung Won Min, et al.
MICRO 2018
We propose a provably transitive-closure ordering rule with theoretical foundations to prune suboptimal design solutions in the presence of process variations. As an example, this probabilistic ordering rule is applied to develop an efficient variational buffering algorithm. Compared to the conventional deterministic approach, variational buffering improves the parametric timing yield by 15.7% on average. This transitive-closure ordering rule may be leveraged to solve other computer-aided-design problems considering process variation effects. © 2007 IEEE.
Mohammad Alian, Seung Won Min, et al.
MICRO 2018
Jason Cong, Lei He, et al.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Jie Wu, Peter Feldmann, et al.
SmartGridComm 2015
Jaeyong Chung, Jinjun Xiong, et al.
DAC 2011