Design and analysis of physical design algorithms

Authors:
Majid Sarrafzadeh;Elaheh Bozorgzadeh;Ryan Kastner;Ankur Srivastava
Affiliations:
Computer Science Department, University of California, Los Angeles, Los Angeles, California;Computer Science Department, University of California, Los Angeles, Los Angeles, California;Computer Science Department, University of California, Los Angeles, Los Angeles, California;Computer Science Department, University of California, Los Angeles, Los Angeles, California
Venue:
Proceedings of the 2001 international symposium on Physical design
Year:
2001

Citing 9
Cited 2

Randomized algorithms

Randomized algorithms
Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
Global min-cuts in RNC, and other ramifications of a simple min-out algorithm

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
On the global fanout optimization problem

ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Potential slack: an effective metric of combinational circuit performance

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Mathematical Structures Underlying Greedy Algorithms

FCT '81 Proceedings of the 1981 International FCT-Conference on Fundamentals of Computation Theory
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference

Physical design methodologies for performance predictability and manufacturability

Proceedings of the 1st conference on Computing frontiers
FPGA placement using space-filling curves: Theory meets practice

ACM Transactions on Embedded Computing Systems (TECS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We will review a few key algorithmic and analysis concepts with application to physical design problems. We argue that design and detailed analysis of algorithms is of fundamental importance in developing better physical design tools and to cope with the complexity of present-day designs.