Timing-Driven Bipartitioning with Replication Using Iterative Quadratic Programming

Wanchai, Hong Kong January 18-January 21

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/ASPDAC.1999.759724

Asia and South Pacific Design Automat ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Shihliang Ou Articles by Massoud Pedram

	ASCII Text	x
	Shihliang Ou, Massoud Pedram, "Timing-Driven Bipartitioning with Replication Using Iterative Quadratic Programming," Asia and South Pacific Design Automation Conference, pp. 105, Asia and South Pacific Design Automation Conference 1999 (ASP-DAC'99), 1999.

	BibTex	x
	@article{ 10.1109/ASPDAC.1999.759724, author = {Shihliang Ou and Massoud Pedram}, title = {Timing-Driven Bipartitioning with Replication Using Iterative Quadratic Programming}, journal ={Asia and South Pacific Design Automation Conference}, volume = {0}, year = {1999}, isbn = {0-7803-5012-X}, pages = {105}, doi = {http://doi.ieeecomputersociety.org/10.1109/ASPDAC.1999.759724}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Asia and South Pacific Design Automation Conference TI - Timing-Driven Bipartitioning with Replication Using Iterative Quadratic Programming SN - 0-7803-5012-X SP EP A1 - Shihliang Ou, A1 - Massoud Pedram, PY - 1999 KW - null VL - 0 JA - Asia and South Pacific Design Automation Conference ER -

Shihliang Ou, University of Southern California, Los Angeles

Massoud Pedram, University of Southern California, Los Angeles

We present an algorithm for solving a general min-cut, two-way partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem and solved in two phases: cut-set minimization and timing satisfaction. A mathematical programming technique based on iterative quadratic programming (TPIQ) is used to find an approximate solution to the constrained problem. When the timing constraints are too strict to have a feasible solution, node replication is used to satisfy the constraints. Experimental results on ISCAS89 benchmark suite show that TPIQ can solve the timing-driven bipartitioning problem with little impact on the chip size.

Citation:

Shihliang Ou, Massoud Pedram, "Timing-Driven Bipartitioning with Replication Using Iterative Quadratic Programming," asp-dac, pp.105, Asia and South Pacific Design Automation Conference 1999 (ASP-DAC'99), 1999

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.