Sequential Monte Carlo techniques for the solution of linear systems
Journal of Scientific Computing
An Approximate Minimum Degree Ordering Algorithm
SIAM Journal on Matrix Analysis and Applications
Generic global placement and floorplanning
DAC '98 Proceedings of the 35th annual Design Automation Conference
Can recursive bisection alone produce routable placements?
Proceedings of the 37th Annual Design Automation Conference
Random walks in a supply network
Proceedings of the 40th annual Design Automation Conference
Reducing the bandwidth of sparse symmetric matrices
ACM '69 Proceedings of the 1969 24th national conference
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
Proceedings of the 2004 international symposium on Physical design
Physical placement driven by sequential timing analysis
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Engineering details of a stable force-directed placer
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Electrothermal analysis and optimization techniques for nanoscale integrated circuits
ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
DPlace2.0: a stable and efficient analytical placement based on diffusion
Proceedings of the 2008 Asia and South Pacific Design Automation Conference
Addressing thermal and power delivery bottlenecks in 3D circuits
Proceedings of the 2009 Asia and South Pacific Design Automation Conference
A parallel direct solver for the simulation of large-scale power/ground networks
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Incremental solution of power grids using random walks
Proceedings of the 2010 Asia and South Pacific Design Automation Conference
Power grid analysis with hierarchical support graphs
Proceedings of the International Conference on Computer-Aided Design
| Hi-index | 0.00 |
This paper presents a new hybrid linear equation solver for quadratic placement. The new solver is a combination of stochastic solver and iterative solver: it is proven in this paper that an approximate LDL factorization can be obtained from random walks, and used as a preconditioner for conjugate gradient solver. Testing on real-life placement benchmarks shows a speedup of up to 7.1 times over traditional Incomplete Cholesky preconditioned Conjugate Gradient (ICCG).