Design and analysis of physical design algorithms

Proceedings of the International Symposium on Physical Design

Volumn , Issue , 2001, Pages 82-89

  Sarrafzadeh, M ^a   Bozorgzadeh, E ^a   Kastner, R ^a   Srivastava, A ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GLOBAL OPTIMIZATION; HEURISTIC METHODS; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

PHYSICAL DESIGN PROBLEMS; SATISFIABILITY (SAT) PROBLEMS;

COMPUTER AIDED DESIGN;

EID: 0034818689     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/369691.369742     Document Type: Conference Paper

References (24)

1. Generation of performance constraints for layout
2. A new performance driven placement algorithm
3. Timing constraints for correct performance
4. A graph-based delay budgeting algorithm for large scale timing-driven placement problems
5. Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm
6. A linear time heuristic for improving network partitioning
7. An efficient heuristic procedure for partitioning graphs
8. Shortest connection networks and some generalizations
9. Mathematical structures underlying greedy algorithms
10. An improved two-way partitioning algorithm with stable performance
11. Fast spectral methods for ratio cut partitioning and clustering
12. Quadrisection: A new approach to standard cell layout
13. Standard cell placement by quadrisection
14. Clustering to minimize the maximum intercluster distance
15. On the global fanout optimization problem
16. The complexity of theorem-proving procedures
17. Reducibility among combinatorial problems
18. Potential slack: An effective metric of combinational circuit performance
19. Shortest path through a maze
20. An algorithm for path connection and its applications