Abstract
In this paper, we consider the thermal placement problem for gate arrays. We introduce a new combinatorial optimization problem MSP (Matrix Synthesis Problem) to model the thermal placement problem. Given a list of mn non-negative real numbers and an integer t, MSP constructs a m × n matrix out of the given numbers such that the maximum sum among all t×t sub-matrices is minimized. We show that MSP is NP-complete and present several provably good approximation algorithms for the problem. We also demonstrate that our thermal placement strategy is flexible enough to allow simultaneous consideration of other objectives such as wiring.
| Original language | English (US) |
|---|---|
| Pages | 163-168 |
| Number of pages | 6 |
| State | Published - 1997 |
| Externally published | Yes |
| Event | Proceedings of the 1997 1st International Symposium on Physical Design, ISPD - Napa Valley, CA, USA Duration: Apr 14 1997 → Apr 16 1997 |
Other
| Other | Proceedings of the 1997 1st International Symposium on Physical Design, ISPD |
|---|---|
| City | Napa Valley, CA, USA |
| Period | 4/14/97 → 4/16/97 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering