J4

• Original Articles • Previous Articles     Next Articles

Buffer and wiresizing optimization based on MOGA/SOS

QI Chang;WANG Gao-feng
  

  1. (Inst. of Microelectronics and Information Technology, Wuhan Univ., Wuhan 430072, China)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-08-20 Published:2007-07-10

Abstract: We present a new multi-objective genetic algorithm(MOGA) which uses a single objective sorting(SOS) method for constructing the non-dominated set to solve the multi-objective interconnect buffer and wiresizing optimization problem under a distributed RLC model. The optimal objective includes the interconnect delay, signal waveform and routing area. We use a new method to calculate the lower bound of crosstalk, and use it as a constraint. The MOGA/SOS optimal algorithm provides a smooth trade-off among signal delay, wave form, and routing area. Extensive experimental results show that our algorithm is scalable with the problem size. Furthermore, compared to the solution based on an Elmore delay model, our solution reduces the total routing area by up to 30%, and the delay to the critical sinks by up to 25%. At the same time it improves crosstalk up to 25. 73% on average.

Key words: buffer, wiresizing optimization, RLC model, crosstalk, MOGA/SOS optimal algorithm

CLC Number: 

  • TN4