期刊文献+

Buffer and Wiresizing Optimization under the Distributed RLC Model with Crosstalk Constraint

Buffer and Wiresizing Optimization under the Distributed RLC Model with Crosstalk Constraint
下载PDF
导出
摘要 In this paper, we study the interconnect buffer and wiresizing optimization problem under a distributed RLC model to optimize not just area and delay, but also crosstalk for RLC circuit with non-monotone signal response. We present a new multiobjective genetic algorithm(MOGA) which uses a single objective sorting(SOS) method for constructing the non-dominated set to solve this multi-objective interconnect optimization problem. The MOGA/SOS optimal algorithm provides a smooth trade-off among signal delay, wave form, and routing area. Furthermore, we use a new method to calculate the lower bound of crosstalk. Extensive experimental results show that our algorithm is scalable with problem size. Furthermore, compared to the solution based on an Elmore delay model, our solution reduces the total routing area by up to 30%, the delay to the critical sinks by up to 25%, while further improving crosstalk up to 25.73% on average. In this paper, we study the interconnect buffer and wiresizing optimization problem under a distributed RLC model to optimize not just area and delay, but also crosstalk for RLC circuit with non-monotone signal response. We present a new multiobjective genetic algorithm(MOGA) which uses a single objective sorting(SOS) method for constructing the non-dominated set to solve this multi-objective interconnect optimization problem. The MOGA/SOS optimal algorithm provides a smooth trade-off among signal delay, wave form, and routing area. Furthermore, we use a new method to calculate the lower bound of crosstalk. Extensive experimental results show that our algorithm is scalable with problem size. Furthermore, compared to the solution based on an Elmore delay model, our solution reduces the total routing area by up to 30%, the delay to the critical sinks by up to 25%, while further improving crosstalk up to 25.73% on average.
出处 《Wuhan University Journal of Natural Sciences》 CAS 2007年第6期1051-1056,共6页 武汉大学学报(自然科学英文版)
基金 Supported by the National Natural Science Foundation of China (90307017)
关键词 buffer insertion wiresizing optimization distributed RLC model CROSSTALK MOGA/SOS optimal algorithm buffer insertion wiresizing optimization distributed RLC model crosstalk MOGA/SOS optimal algorithm
  • 相关文献

参考文献10

  • 1Jensen M T.Reducing the Run-Time Complexity of Multi- Objective Eas: the NSGAII and Other Algorithm[].IEEE Trans Evol.2003
  • 2Kalyanmoy D.Multi-Objective Optimization Using Evolution- ary Algorithms[]..2001
  • 3Daid A,Gary B.Multi-Objective Evolutionary Algorithms: Analyzing the State of the Art[].Evolutionary Computation.2000
  • 4Kahng A B,Muddu S.An Analytical Delay Model for RLC Interconnects[].Proceeding of the IEEE International Symposium on Circuits and Systems.1996
  • 5Qi C,Wang G F.Performance-Driven Routing Tree Construc- tion with Buffer Insertion, Wire Sizing under RLC Delay Model[].Proceeding of the th IEEE Mechatronics and Automation Conference.2007
  • 6Leung K S,Cong J.Fast Optimal Algorithms for the Mini- mum Rectilinear Steiner Arborescence Problem[].Pro- ceeding of the IEEE International Symposium on Circuits and Systems.1997
  • 7Cong J,Okmaoto T.Buffer Steiner Tree Construction with Wire Sizing for Interconnect Layout Optimization[].Proceeding of the IEEE ACM International Conference on Computer-Aided Design.1996
  • 8Cong J,Kong T M,Pan Z.Buffer Block Planning for Inter- connect Planning and Prediction[].IEEE Trans on very Large Scale Intergrated (VLSI) System.2001
  • 9Lai M,Wong D F.Maze Routing with Buffer Insertion and Wiresizing[].Proceeding of the th IEEE Design Automa- tion Conference.2000
  • 10Li Z,Shi W P.An O(mn) Time Algorithm for Optimal Buffer Insertion for Nets with m Sinks[].Proceeding of the Asia and South Pacific Design Automation Conference.2006

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部