拥挤度驱动的总体布线层分配算法  

Congestion Driven Global Routing Layer Assignment Algorithm

作　　者：周强[1] 周毅[1] 蔡懿慈[1] 洪先龙[1] 

机构地区：[1]清华大学计算机科学与技术系,北京100084

出　　处：《计算机辅助设计与图形学学报》2004年第7期1005-1009,共5页Journal of Computer-Aided Design & Computer Graphics

基　　金：国家自然科学基金 ( 60 1760 16);国家"八六三"高技术研究发展计划( 2 0 0 2AAIZ14 60 )资助

摘　　要：针对多层布线问题 ,提出以拥挤度为驱动目标 ,完成布线资源的合理分配 ,同时达到布线层资源占用少和通孔数少等优化目标的层分配算法 首先采用启发式方法获得初始分配方案 ,然后通过模拟退火技术优化分配结果 ,最后采用试探策略优化层资源占用 工业实验数据表明 ,该算法能够实现线网层合理分配 。Aiming at optimal congestion control, assigning proper routing layer resource and meeting other optimization objectives such as the number of layers and vias, a new layer assignment algorithm for multilayer routing problem was proposed The algorithm consists of 3 phases: first, it acquires initial solution by heuristic approach, then optimizes the initial result by simulated annealing and at last, it optimizes resources of routing layer The proposed algorithm was tested with industrial circuits and experimental result shows that the algorithm can accomplish proper layer assignment

关 键 词：布线 层分配 拥挤度 模拟退火算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]