Unification of budgeting and placement

Authors:
Majid Sarrafzadeh;David Knol;Gustavo Tellez
Affiliations:
Department of Electrical and Computer Engineering, Northwestern University, Evanston, IL;Department of Electrical and Computer Engineering, Northwestern University, Evanston, IL;Department of Electrical and Computer Engineering, Northwestern University, Evanston, IL
Venue:
DAC '97 Proceedings of the 34th annual Design Automation Conference
Year:
1997

Citing 2
Cited 11

Iterative and adaptive slack allocation for performance-driven layout and FPGA routing

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Minplex—a compactor that minimizes the bounding rectangle and individual rectangles in a layout

DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference

Transformational placement and synthesis

DATE '00 Proceedings of the conference on Design, automation and test in Europe
Analytical minimization of half-perimeter wirelength

ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
Post-layout timing-driven cell placement using an accurate net length model with movable Steiner points

Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Min-max placement for large-scale timing optimization

Proceedings of the 2002 international symposium on Physical design
Delay budgeting for a timing-closure-driven design method

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Large-Scale Circuit Placement: Gap and Promise

Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Large-scale circuit placement

ACM Transactions on Design Automation of Electronic Systems (TODAES)
A unified theory of timing budget management

Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Probabilistic Delay Budgeting for Soft Realtime Applications

ISQED '06 Proceedings of the 7th International Symposium on Quality Electronic Design
A new LP based incremental timing driven placement for high performance designs

Proceedings of the 43rd annual Design Automation Conference
Probabilistic delay budget assignment for synthesis of soft real-time applications

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a novel formulation for thenet-based timing-driven placement problem.The new formulationperforms budgeting (net delay upper bounds) andplacement modification simultaneously thus alleviates theproblem of going back-and-forth between budgeting andplacement.An algorithm to accomplished the proposedtask is presented.The proposed algorithm uses a simulatedannealing approach and a modified graph-based simplexmethod.A general formulation of timing-sriven placementis presented.It is proved that both net-based andpath-based approaches to timing-driven placement are specialcases of a more general formulation.The proposed algorithmhas been incorporated into a (timing-driven) placementpackage.Experiments on MCNC benchmarks showstrong results.The proposed algorithm offers 54% to 68%reduction over the longest path compared with the existingalgorithms.