Parallel Algorithms for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction

• Main Authors: Cheng-Yuan Chang, 張政源
• Other Authors: 曾奕倫
• Format: Others
• Language: zh-TW
• Online Access: http://ndltd.ncl.edu.tw/handle/70484244380143531633

碩士 === 元智大學 === 資訊工程學系 === 100 === In the field of integrated circuit physical design automation, the problem of obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is a fundamental problem and has attracted a lot of research attention. In this thesis, three parallel algorithms for constructing OARSMTs are proposed. These algorithms are based on maze routing and double front-wave expansion. The first proposed algorithm uses the method of partitioning the original routing region into smaller regions. With regard to the second algorithm, the original routing region is not partitioned. However, a technique for concurrent connections of wires within small regions and a technique for cleaning up partial routing information are used. The third algorithm uses the approach of compressing the original routing region into another region with fewer coordinates. Experimental results show that the second parallel algorithm not only generates very short wires, but also performs efficiently on shared-memory multi-core computer systems.