An efficient macro-cell placement algorithm

E.H.L. Aarts; F.M.J. Bont de; J.H.M. Korst; J.M.J. Rongen

doi:10.1016/S0167-9260(05)80023-9

An efficient macro-cell placement algorithm

E.H.L. Aarts, F.M.J. Bont de, J.H.M. Korst, J.M.J. Rongen

Research output: Contribution to journal › Article › Scientific › peer-review

2 Citations (Scopus)

Abstract

A new approximation algorithm is presented for the efficient handling of large macro-cell placement problems. The algorithm combines simulated annealing with new features based on a hierarchical approach and a divide-and-conquer technique. Numerical results show that these features can lead to a considerable increase in efficiency of the placement algorithm without loss of effectiveness.

Original language	English
Pages (from-to)	299-317
Number of pages	19
Journal	Integration : the VLSI Journal
Volume	10
Issue number	3
DOIs	https://doi.org/10.1016/S0167-9260(05)80023-9
Publication status	Published - 1991
Externally published	Yes

Access to Document

10.1016/S0167-9260(05)80023-9

Cite this

@article{69588ea9c5d346bd98aaac7d53190cba,

title = "An efficient macro-cell placement algorithm",

abstract = "A new approximation algorithm is presented for the efficient handling of large macro-cell placement problems. The algorithm combines simulated annealing with new features based on a hierarchical approach and a divide-and-conquer technique. Numerical results show that these features can lead to a considerable increase in efficiency of the placement algorithm without loss of effectiveness.",

author = "E.H.L. Aarts and {Bont de}, F.M.J. and J.H.M. Korst and J.M.J. Rongen",

year = "1991",

doi = "10.1016/S0167-9260(05)80023-9",

language = "English",

volume = "10",

pages = "299--317",

journal = "Integration : the VLSI Journal",

issn = "0167-9260",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - An efficient macro-cell placement algorithm

AU - Aarts, E.H.L.

AU - Bont de, F.M.J.

AU - Korst, J.H.M.

AU - Rongen, J.M.J.

PY - 1991

Y1 - 1991

N2 - A new approximation algorithm is presented for the efficient handling of large macro-cell placement problems. The algorithm combines simulated annealing with new features based on a hierarchical approach and a divide-and-conquer technique. Numerical results show that these features can lead to a considerable increase in efficiency of the placement algorithm without loss of effectiveness.

AB - A new approximation algorithm is presented for the efficient handling of large macro-cell placement problems. The algorithm combines simulated annealing with new features based on a hierarchical approach and a divide-and-conquer technique. Numerical results show that these features can lead to a considerable increase in efficiency of the placement algorithm without loss of effectiveness.

U2 - 10.1016/S0167-9260(05)80023-9

DO - 10.1016/S0167-9260(05)80023-9

M3 - Article

SN - 0167-9260

VL - 10

SP - 299

EP - 317

JO - Integration : the VLSI Journal

JF - Integration : the VLSI Journal

IS - 3

ER -

An efficient macro-cell placement algorithm

Abstract

Access to Document

Fingerprint

Cite this