In accordance with regulations and requirements, the editorial department's website domain has been changed to arocmag.cn. The original domain (arocmag.com) will be discontinued after Dec. 31st, 2024.
See More
Algorithm Research & Explore
|
App. Res. of Comp. Printed Article
Vol. 41, 2024 No. 9
2751-2757

Non-smooth floorplanning method based on conjugate sub-gradient algorithm

Sun Jian1a
Xu Ning1b
Wu Jian1b
Zhu Zhanyang1b
Chen Yu1a
Hu Jianguo2
1. a. School of Science, b. School of Information Engineering, Wuhan University of Technology, Wuhan 430070, China
2. Shenzhen Research Institute, Sun Yat-Sen University, Shenzhen Guangdong 528406, China
DOI: 10.19734/j.issn.1001-3695.2023.12.0628

Abstract

Aiming at the floorplanning problem with only hard modules, it is usually constructed as a combinatorial optimization model, but the time cost of solving process is high. In order to improve the solving efficiency, this paper proposed a floorplanning algorithm based on non-smooth analytic mathematical programming. Based on the coordinate representation of modules, this paper established a non-smooth mathematical programming model, which was a generalization of the optimization models corresponding to various optimization stages of different cases that were solved by the conjugate sub-gradient algorithm(CSA). Aiming at the fixed-outline floorplanning problem, this paper achieved wirelength optimization under fixed-outline constraint through the general framework consisted of three stages: global floorplanning, legalization and local optimization. To address the case without fixed-outline constraint, this paper proposed a conjugate sub-gradient algorithm with golden section strategy(CSA_GSS). The algorithm adopted golden section strategy to reduce the area of the fixed-outline and to achieve the dual effect of both area and wirelength optimization. Compared with floorplanning algorithm based on B*-tree on GSRC test circuit, the proposed algorithm had advantages in terms of wirelength and time for large-scale circuits. Experimental results show that the algorithm can obtain better wirelength with lower time complexity.

Foundation Support

深圳科技计划资助项目(JCYJ20220818102002005)
科技部科技创新2030—“新一代人工智能”重大项目(2021ZD0114600)

Publish Information

DOI: 10.19734/j.issn.1001-3695.2023.12.0628
Publish at: Application Research of Computers Printed Article, Vol. 41, 2024 No. 9
Section: Algorithm Research & Explore
Pages: 2751-2757
Serial Number: 1001-3695(2024)09-026-2751-07

Publish History

[2024-05-14] Accepted Paper
[2024-09-05] Printed Article

Cite This Article

孙健, 徐宁, 吴建, 等. 一种基于共轭次梯度算法的非光滑布图规划方法 [J]. 计算机应用研究, 2024, 41 (9): 2751-2757. (Sun Jian, Xu Ning, Wu Jian, et al. Non-smooth floorplanning method based on conjugate sub-gradient algorithm [J]. Application Research of Computers, 2024, 41 (9): 2751-2757. )

About the Journal

  • Application Research of Computers Monthly Journal
  • Journal ID ISSN 1001-3695
    CN  51-1196/TP

Application Research of Computers, founded in 1984, is an academic journal of computing technology sponsored by Sichuan Institute of Computer Sciences under the Science and Technology Department of Sichuan Province.

Aiming at the urgently needed cutting-edge technology in this discipline, Application Research of Computers reflects the mainstream technology, hot technology and the latest development trend of computer application research at home and abroad in a timely manner. The main contents of the journal include high-level academic papers in this discipline, the latest scientific research results and major application results. The contents of the columns involve new theories of computer discipline, basic computer theory, algorithm theory research, algorithm design and analysis, blockchain technology, system software and software engineering technology, pattern recognition and artificial intelligence, architecture, advanced computing, parallel processing, database technology, computer network and communication technology, information security technology, computer image graphics and its latest hot application technology.

Application Research of Computers has many high-level readers and authors, and its readers are mainly senior and middle-level researchers and engineers engaged in the field of computer science, as well as teachers and students majoring in computer science and related majors in colleges and universities. Over the years, the total citation frequency and Web download rate of Application Research of Computers have been ranked among the top of similar academic journals in this discipline, and the academic papers published are highly popular among the readers for their novelty, academics, foresight, orientation and practicality.

Indexed & Evaluation

  • The Second National Periodical Award 100 Key Journals
  • Double Effect Journal of China Journal Formation
  • the Core Journal of China (Peking University 2023 Edition)
  • the Core Journal for Science
  • Chinese Science Citation Database (CSCD) Source Journals
  • RCCSE Chinese Core Academic Journals
  • Journal of China Computer Federation
  • 2020-2022 The World Journal Clout Index (WJCI) Report of Scientific and Technological Periodicals
  • Full-text Source Journal of China Science and Technology Periodicals Database
  • Source Journal of China Academic Journals Comprehensive Evaluation Database
  • Source Journals of China Academic Journals (CD-ROM Version), China Journal Network
  • 2017-2019 China Outstanding Academic Journals with International Influence (Natural Science and Engineering Technology)
  • Source Journal of Top Academic Papers (F5000) Program of China's Excellent Science and Technology Journals
  • Source Journal of China Engineering Technology Electronic Information Network and Electronic Technology Literature Database
  • Source Journal of British Science Digest (INSPEC)
  • Japan Science and Technology Agency (JST) Source Journal
  • Russian Journal of Abstracts (AJ, VINITI) Source Journals
  • Full-text Journal of EBSCO, USA
  • Cambridge Scientific Abstracts (Natural Sciences) (CSA(NS)) core journals
  • Poland Copernicus Index (IC)
  • Ulrichsweb (USA)