• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
成果搜索

author:

Cai, H. (Cai, H..) [1] | Zhou, R. (Zhou, R..) [2] | Huang, P. (Huang, P..) [3] | Jing, Y. (Jing, Y..) [4] | Liu, G. (Liu, G..) [5]

Indexed by:

Scopus

Abstract:

In modern circuit design, the short-circuit problem is one of the key factors affecting routability. With the continuous reduction in feature sizes, the short-circuit problem grows significantly in detailed routing. Track assignment, as a crucial intermediary phase between global routing and detailed routing, plays a vital role in preprocessing the short-circuit problem. However, existing track assignment algorithms face the challenge of easily falling into local optimality. As a typical swarm intelligence technique, particle swarm optimization (PSO) is a powerful tool with excellent optimization ability to solve large-scale problems. To address the above issue, we propose an effective track assignment algorithm based on social learning discrete particle swarm optimization (SLDPSO-TA). First, an effective wire model that considers the local nets is proposed. By considering the pin distribution of local nets, this model extracts and allocates more segments to fully leverage the role of track assignment. Second, an integer encoding strategy is employed to ensure that particles within the encoding space range correspond one-to-one with the assignment scheme, effectively expanding the search space. Third, a social learning mode based on the example pool is introduced to PSO, which is composed of other particles that are superior to the current particle. By learning from various objects in the example pool, the diversity of the population is improved. Fourth, a negotiation-based refining strategy is utilized to further reduce overlap. This strategy intelligently transfers and redistributes wire segments in congested areas to reduce congestion across the entire routing panel. Experimental results on multiple benchmarks demonstrate that the proposed SLDPSO-TA can achieve the best overlap cost optimization among all the existing methods, effectively reducing congestion in critical routing areas. © 2024 by the authors.

Keyword:

conflict minimization example pool particle swarm optimization rip-up and reroute track assignment

Community:

  • [ 1 ] [Cai H.]College of Computer and Data Science, Fuzhou University, Fuzhou, 350116, China
  • [ 2 ] [Cai H.]Engineering Research Center of Big Data Intelligence, Ministry of Education, Fuzhou University, Fuzhou, 350116, China
  • [ 3 ] [Cai H.]Fujian Key Laboratory of Network Computing and Intelligent Information Processing, Fuzhou University, Fuzhou, 350116, China
  • [ 4 ] [Zhou R.]College of Computer and Data Science, Fuzhou University, Fuzhou, 350116, China
  • [ 5 ] [Zhou R.]Engineering Research Center of Big Data Intelligence, Ministry of Education, Fuzhou University, Fuzhou, 350116, China
  • [ 6 ] [Zhou R.]Fujian Key Laboratory of Network Computing and Intelligent Information Processing, Fuzhou University, Fuzhou, 350116, China
  • [ 7 ] [Huang P.]College of Computer and Data Science, Fuzhou University, Fuzhou, 350116, China
  • [ 8 ] [Huang P.]Engineering Research Center of Big Data Intelligence, Ministry of Education, Fuzhou University, Fuzhou, 350116, China
  • [ 9 ] [Huang P.]Fujian Key Laboratory of Network Computing and Intelligent Information Processing, Fuzhou University, Fuzhou, 350116, China
  • [ 10 ] [Jing Y.]College of Computer and Data Science, Fuzhou University, Fuzhou, 350116, China
  • [ 11 ] [Jing Y.]Engineering Research Center of Big Data Intelligence, Ministry of Education, Fuzhou University, Fuzhou, 350116, China
  • [ 12 ] [Jing Y.]Fujian Key Laboratory of Network Computing and Intelligent Information Processing, Fuzhou University, Fuzhou, 350116, China
  • [ 13 ] [Liu G.]College of Computer and Data Science, Fuzhou University, Fuzhou, 350116, China
  • [ 14 ] [Liu G.]Engineering Research Center of Big Data Intelligence, Ministry of Education, Fuzhou University, Fuzhou, 350116, China
  • [ 15 ] [Liu G.]Fujian Key Laboratory of Network Computing and Intelligent Information Processing, Fuzhou University, Fuzhou, 350116, China

Reprint 's Address:

Email:

Show more details

Related Keywords:

Related Article:

Source :

Electronics (Switzerland)

ISSN: 2079-9292

Year: 2024

Issue: 22

Volume: 13

1 . 7 6 4

JCR@2018

Cited Count:

WoS CC Cited Count:

SCOPUS Cited Count:

ESI Highly Cited Papers on the List: 0 Unfold All

WanFang Cited Count:

Chinese Cited Count:

30 Days PV: 0

Affiliated Colleges:

Online/Total:104/10070095
Address:FZU Library(No.2 Xuyuan Road, Fuzhou, Fujian, PRC Post Code:350116) Contact Us:0591-22865326
Copyright:FZU Library Technical Support:Beijing Aegean Software Co., Ltd. 闽ICP备05005463号-1