An effective timing-driven placement algorithm for macro cells

Ching Ting Wu; Andrew Lim; David Du

doi:10.1109/ICVD.1992.658017

An effective timing-driven placement algorithm for macro cells

Ching Ting Wu, Andrew Lim, David Du

Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Scopus citations

Abstract

In this paper, we present an effective path-oriented timing driven placement algorithm for macro cells. Our constructive algorithm minimizes the longest path in the circuit such that total wire length of the placc- ment does not exceed a bound provided by the user. The algorithm also allows fixed and movable I/O pin- s. It uses the concept of partial paths to reduce the run time and dynamic path delay estimation to update and approximate path delays. Our approach is superior to Lin(l] in terms of quality of solutions and run times.

Original language	English (US)
Title of host publication	Proceedings - VLSI Design 1992
Subtitle of host publication	The 5th International Conference on VLSI Design, ICVD 1992
Publisher	IEEE Computer Society
Pages	31-36
Number of pages	6
ISBN (Electronic)	0818624655
DOIs	https://doi.org/10.1109/ICVD.1992.658017
State	Published - Jan 1 1992
Event	5th International Conference on VLSI Design, ICVD 1992 - Banglore, India Duration: Jan 4 1992 → Jan 7 1992

Publication series

Name	Proceedings of the IEEE International Conference on VLSI Design
ISSN (Print)	1063-9667

Conference

Conference	5th International Conference on VLSI Design, ICVD 1992
Country/Territory	India
City	Banglore
Period	1/4/92 → 1/7/92

Publisher link

10.1109/ICVD.1992.658017

Find It

Find It at U of M Libraries

Cite this

An effective timing-driven placement algorithm for macro cells. / Wu, Ching Ting; Lim, Andrew; Du, David.
Proceedings - VLSI Design 1992: The 5th International Conference on VLSI Design, ICVD 1992. IEEE Computer Society, 1992. p. 31-36 658017 (Proceedings of the IEEE International Conference on VLSI Design).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Wu, CT, Lim, A & Du, D 1992, An effective timing-driven placement algorithm for macro cells. in Proceedings - VLSI Design 1992: The 5th International Conference on VLSI Design, ICVD 1992., 658017, Proceedings of the IEEE International Conference on VLSI Design, IEEE Computer Society, pp. 31-36, 5th International Conference on VLSI Design, ICVD 1992, Banglore, India, 1/4/92. https://doi.org/10.1109/ICVD.1992.658017

@inproceedings{9ab6c9225dcc45698f0b7fdfdb0430ef,

title = "An effective timing-driven placement algorithm for macro cells",

abstract = "In this paper, we present an effective path-oriented timing driven placement algorithm for macro cells. Our constructive algorithm minimizes the longest path in the circuit such that total wire length of the placc- ment does not exceed a bound provided by the user. The algorithm also allows fixed and movable I/O pin- s. It uses the concept of partial paths to reduce the run time and dynamic path delay estimation to update and approximate path delays. Our approach is superior to Lin(l] in terms of quality of solutions and run times.",

author = "Wu, {Ching Ting} and Andrew Lim and David Du",

year = "1992",

month = jan,

day = "1",

doi = "10.1109/ICVD.1992.658017",

language = "English (US)",

series = "Proceedings of the IEEE International Conference on VLSI Design",

publisher = "IEEE Computer Society",

pages = "31--36",

booktitle = "Proceedings - VLSI Design 1992",

note = "5th International Conference on VLSI Design, ICVD 1992 ; Conference date: 04-01-1992 Through 07-01-1992",

}

TY - GEN

T1 - An effective timing-driven placement algorithm for macro cells

AU - Wu, Ching Ting

AU - Lim, Andrew

AU - Du, David

PY - 1992/1/1

Y1 - 1992/1/1

N2 - In this paper, we present an effective path-oriented timing driven placement algorithm for macro cells. Our constructive algorithm minimizes the longest path in the circuit such that total wire length of the placc- ment does not exceed a bound provided by the user. The algorithm also allows fixed and movable I/O pin- s. It uses the concept of partial paths to reduce the run time and dynamic path delay estimation to update and approximate path delays. Our approach is superior to Lin(l] in terms of quality of solutions and run times.

AB - In this paper, we present an effective path-oriented timing driven placement algorithm for macro cells. Our constructive algorithm minimizes the longest path in the circuit such that total wire length of the placc- ment does not exceed a bound provided by the user. The algorithm also allows fixed and movable I/O pin- s. It uses the concept of partial paths to reduce the run time and dynamic path delay estimation to update and approximate path delays. Our approach is superior to Lin(l] in terms of quality of solutions and run times.

UR - http://www.scopus.com/inward/record.url?scp=3042876061&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3042876061&partnerID=8YFLogxK

U2 - 10.1109/ICVD.1992.658017

DO - 10.1109/ICVD.1992.658017

M3 - Conference contribution

AN - SCOPUS:3042876061

T3 - Proceedings of the IEEE International Conference on VLSI Design

SP - 31

EP - 36

BT - Proceedings - VLSI Design 1992

PB - IEEE Computer Society

T2 - 5th International Conference on VLSI Design, ICVD 1992

Y2 - 4 January 1992 through 7 January 1992

ER -

An effective timing-driven placement algorithm for macro cells

Abstract

Publication series

Conference

Publisher link

Find It

Other files and links

Fingerprint

Cite this