2014
DOI: 10.1142/s0218126614500984
|View full text |Cite
|
Sign up to set email alerts
|

Fast Algorithms for Thermal-Aware Floorplanning

Abstract: Thermal-aware°oorplanning is an e®ective way to solve the thermal problem in modern integrated circuit (IC) designs. Existing thermal-aware°oorplanning methods are all based on simulated annealing (SA), genetic algorithms (GAs) or linear programming (LP), which are quite time-consuming. In this paper, we propose two fast algorithms for thermal-aware°oorplanning, a greedy algorithm based on the less-°exibility-¯rst (LFF) principle and a hybrid algorithm combining the greedy algorithm and an SA-based re¯nement. … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
4
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 22 publications
0
4
0
Order By: Relevance
“…Here optimization has been obtained for chip area, wire length, and on-chip temperature. The author in [22] presents two fast thermal-aware algorithms, one greedy and the other SA-Greedy hybrid algorithm for optimizing area and temperature of nonslicing floorplan. Like [20], the complexity of temperature computation was also avoided in [22].…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations
“…Here optimization has been obtained for chip area, wire length, and on-chip temperature. The author in [22] presents two fast thermal-aware algorithms, one greedy and the other SA-Greedy hybrid algorithm for optimizing area and temperature of nonslicing floorplan. Like [20], the complexity of temperature computation was also avoided in [22].…”
Section: Introductionmentioning
confidence: 99%
“…The author in [22] presents two fast thermal-aware algorithms, one greedy and the other SA-Greedy hybrid algorithm for optimizing area and temperature of nonslicing floorplan. Like [20], the complexity of temperature computation was also avoided in [22]. Instead of any temperature quantification in the objective function, hotspot minimization has been mechanized in [22] by forming groups containing one hot and three non-hot modules in each and further placing them in floorplan, such that a hot module remains surrounded by the three non-hot modules of its group.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations