A hybrid linear equation solver and its application in quadratic placement

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD

Volumn 2005, Issue , 2005, Pages 905-909

  Qian, Haifeng ^a   Sapatnekar, Sachin S ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; ITERATIVE METHODS; PROBLEM SOLVING; QUADRATIC PROGRAMMING; STOCHASTIC PROGRAMMING; THEOREM PROVING;

CONJUGATE GRADIENT SOLVERS; HYBRID LINEAR EQUATION SOLVERS; LDL FACTORIZATION; QUADRATIC PLACEMENTS;

LINEAR EQUATIONS;

EID: 33751415052     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAD.2005.1560190     Document Type: Conference Paper

References (19)

1. S. Adya and I. Markov, ISPD02 Benchmarks [Online]. Available: http://vlsicad.eecs.umich.edu/BK/ISPD02bench.
2. P. R. Amestoy, T. A. Davis and I. S. Duff, "An approximate minimum degree ordering algorithm," SIAM Journal on Matrix Analysis and Applications, vol. 17, no. 4, pp. 886-905, 1996.
3. R. Barrett, M. Berry, T. F. Chan, J. W. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine and H. A. van der Vorst, Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, Philadelphia, PA: SIAM, 1994.
4. A. E. Caldwell, A. B. Kahng and I. L. Markov, "Can recursive bisection alone produce routable placements?," in Proc. DAC, pp. 477-482, 2000.
5. E. Cuthill and J. McKee, "Reducing the bandwidth of sparse symmetric matrices," in Proceedings of the ACM National Conference, pp. 157-172, 1969.
6. H. Eisenmann and F. M. Johnannes, "Generic global placement and floorplanning," in Proc. DAC, pp. 269-274, 1998.
7. J. H. Halton, "Sequential Monte Carlo," in Proceedings of the Cambridge Philosophical Society, vol. 58, pp. 57-78, 1962.
8. J. H. Halton, "Sequential Monte Carlo techniques for the solution of linear systems," Journal of Scientific Computing, vol. 9, pp. 213-257, 1994.
9. P. Heggernes, S. C. Eisenstat, G. Kumfert and A. Pothen, "The computational complexity of the Minimum Degree algorithm," in Proceedings of 14th Norwegian Computer Science Conference, pp. 98-109, 2001.
10. A. P. Hurst, P. Chong and A. Kuehlmann, "Physical placement driven by sequential timing analysis," in Proc. ICCAD, pp. 379-386, 2004.
11. D. S. Kershaw, "The incomplete cholesky-conjugate gradient method for the iterative solution of systems of linear equations," Journal of Computational Physics, vol. 26, pp. 43-65, 1978.
12. LASPack [Online]. Available: http://www.tu-dresden.de/mwism/skalicky/ laspack/laspack.html.
13. A. W. Marshall, "The use of multi-stage sampling schemes in Monte Carlo," Symposium of Monte Carlo Methods, pp. 123-140. New York, NY: John Wiley & Sons, 1956.
14. H. Qian, S. R. Nassif, and S. S. Sapatnekar, "Random walks in a supply network," in Proc. DAC, pp. 93-98, 2003.
15. Y. Saad, Iterative Methods for Sparse Linear Systems. Philadelpha, PA: SIAM, 2003.
16. C. Sechen and A. Sangiovanni-Vincentelli, "The TimberWolf placement and routing package," IEEE Journal of Solid-State Circuits, vol. 20, no. 2, pp. 510-522, 1985.
17. R. S. Varga, Matrix Iterative Analysis. Englewood Cliffs, NJ: Prentice-Hall, 1962.
18. N. Viswanathan and C. C. Chu, "FastPlace: Efficient analytical placement using cell shifting, iterative local refinement and a hybrid net model," in Proc. ISPD, pp. 26-33, 2004.
19. K. P. Vorwerk, A. Kennings and A. Vannelli, "Engineering details of a stable force-directed placer," in Proc. ICCAD, pp. 573-580, 2004.