The following information was submitted:
Transactions: WSEAS TRANSACTIONS ON CIRCUITS AND SYSTEMS
Transactions ID Number: 27-707
Full Name: Yu-cheng Lin
Position: Assistant Professor
Age: ON
Sex: Male
Address: Department of Information & Electronic Commerce,Kai Nan University. No.1 Kainan Rd, Shinshing Tsuen, Luchu Shiang, Taoyuan, Taiwan.
Country: TAIWAN
Tel: 886-938077984
Tel prefix:
Fax: 886-5735136
E-mail address: linyu@mail.knu.edu.tw
Other E-mails: linyu413@gmail.com
Title of the Paper: an enhanced congestion-driven floorplanner
Authors as they appear in the Paper: Yu-Cheng Lin, Shin-Jia Chen, Ping-Liang Chen, Hsin-Hsiung Huang
Email addresses of all the authors: linyu@mail.knu.edu.tw,shinjia@mail.knu.edu.tw,pingliang@mail.knu.edu.tw,pp002@mail.lhu.edu.tw
Number of paper pages: 11
Abstract: In this paper, a rectilinear-based congestion-driven floorplanning algorithm is presented to enhance the wire congestion and the CPU runtime. The proposed algorithm contains two stages, including the simulated-annealing (SA) based approach with the concept of ant algorithm (SANTA) and the nonlinear programming based method. The objective of the first stage and the second stage are to minimize the multiple objectives, such as the area, wire length and wire congestion, and to further improve the wire congestion of the local congested region without the area overhead, respectively. First, the effective concept of the ant algorithm is integrated into the multiple objectives floorplanner, which simultaneously minimizes area, wire congestion and the total wire length, to speedup the runtime. Besides, the nonlinear programming (NLP) based formulations are provided to perform the module reshaping, which maximizes the common length between two adjacent congested modules. Fo!
r the floorplanner, the sequential-pair (SP) presentation is utilized to deal with the floorplan data at every iteration. For each iteration of the floorplanner, we first use SANTA to improve the neighbor searching and reduce the runtime. After performing the first state, we will obtain a floorplan with the objectives of the area, wire congestion and total length. For the intermediate floorplan, we select the two adjacent soft modules located at the most congested regions and divide the two soft modules into a set of connected sub-rectangles. Hence, we further reduce the congestion by enlarging the common boundary between the selected adjacent modules. Of course, the modular reshaping technique significantly increases the common length and the capacity of pins to reduce the wire congestion by utilizing the nonlinear programming based approach. To deserve to be mentioned that there is no area overhead after we perform the modular reshaping for the selected adjacent modules. !
Compared to the results of the traditional SA, SANTA achieves an avera
ge improvement on the area, the total wire length and CPU runtime by 3% and 8.1% and 23.0%, respectively. To show the superior to our approach, 30 floorplan samples are randomly selected from Microelectronics Center of North Carolina (MCNC) benchmarks. The experimental result shows that the reshaping method improves the wire congestion and total wire length by 22% and 1.54%, respectively.
Keywords: Simulated annealing, Ant algorithm, SANTA, NLP, Module reshaping, Floorplan
EXTENSION of the file: .pdf
Special (Invited) Session: congestion-driven floorplanning with module reshaping
Organizer of the Session: 591-992
How Did you learn about congress: tywang@mail.knu.edu.tw
IP ADDRESS: 61.220.246.245
