Linear programming-based multi-objective floorplanning optimization for system-on-chip

Dayasagar Chowdary, S.; Sudhakar, M. S.

doi:10.1007/s11227-023-05812-0

Cited by 1 publication

(1 citation statement)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another category involves the study of floorplanning algorithms. By employing suitable planar graph representations and/or efficient perturbation methods, high-quality floorplans can be achieved through linear programming [21] or some metaheuristic methods such as simulated annealing (SA) [22,23], genetic algorithms (GA) [24,25], memetic algorithms (MA) [26], and ant colony optimization [27].…”

Section: Introductionmentioning

confidence: 99%

A Deep Reinforcement Learning Floorplanning Algorithm Based on Sequence Pairs

Yu,

Du,

Yang

2024

Applied Sciences

View full text Add to dashboard Cite

In integrated circuit (IC) design, floorplanning is an important stage in obtaining the floorplan of the circuit to be designed. Floorplanning determines the performance, size, yield, and reliability of very large-scale integration circuit (VLSI) ICs. The results obtained in this step are necessary for the subsequent continuous processes of chip design. From a computational perspective, VLSI floorplanning is an NP-hard problem, making it difficult to be efficiently solved by classical optimization techniques. In this paper, we propose a deep reinforcement learning floorplanning algorithm based on sequence pairs (SP) to address the placement problem. Reinforcement learning utilizes an agent to explore the search space in sequence pairs to find the optimal solution. Experimental results on the international standard test circuit benchmarks, MCNC and GSRC, demonstrate that the proposed deep reinforcement learning floorplanning algorithm based on sequence pairs can produce a superior solution.

show abstract