A
Arvind Srinivasan
Researcher at University of California, Berkeley
Publications - 8
Citations - 495
Arvind Srinivasan is an academic researcher from University of California, Berkeley. The author has contributed to research in topics: Routing (electronic design automation) & Nonlinear programming. The author has an hindex of 5, co-authored 7 publications receiving 492 citations.
Papers
More filters
Proceedings ArticleDOI
Clock routing for high-performance ICs
TL;DR: A novel approach to clock routing that all but eliminates clock skew and yields excellent phase delay results for a wide range of chip sizes, net sizes (pin count), minimum feature sizes, and pin distributions on both randomly created and standard industrial benchmarks is presented.
Proceedings ArticleDOI
RITUAL: a performance driven placement algorithm for small cell ICs
TL;DR: An efficient algorithm, RITUAL (residual iterative technique for updating all Lagrange multipliers), for obtaining a placement of cell-based ICs subject to performance constraints is described and yields very good results, as is shown on a set of real examples.
Journal ArticleDOI
RITUAL: a performance driven placement algorithm
TL;DR: An algorithm for obtaining a placement of large scale cell-based ICs subject to performance constraints, formulated as a constrained programming problem and solved in two phases: continuous and discrete.
Proceedings ArticleDOI
A fast algorithm for performance-driven placement
TL;DR: Developing special techniques to take advantage of the interaction between the timing model and the physical position of the cells enabled the authors to achieve a speed-up of 10-15 times over Jackson and Kuh (1989) even with a crude implementation of the algorithm.
Proceedings ArticleDOI
An algorithm for performance-driven initial placement of small-cell ICs
TL;DR: An efficient algorithm for performance driven initial placement is developed and its finiteness proved under less stringent conditions than [JSKSO], and it does not require an initial feasible solution.