SimPL: An effective placement algorithm

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

Volumn , Issue , 2010, Pages 649-656

  Kim, Myung Chul ^a   Lee, Dong Jin ^a   Markov, Igor L ^a  

^a University of Michigan   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING;

BENCHMARK SUITES; FORCE DIRECTED ALGORITHMS; GLOBAL PLACEMENTS; LOWER BOUNDS; PLACEMENT ALGORITHM; SOLUTION QUALITY; UPPER BOUND; WIRE LENGTH;

COMPUTER AIDED DESIGN;

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

References (24)

1. S. N. Adya, I. L. Markov, "Executable Placement Utilities," http://vlsicad.eecs.umich.edu/BK/PlaceUtils/
2. C. J. Alpert et al., "Techniques for Fast Physical Synthesis," Proc. IEEE 95(3), 2007, pp. 573-599.
3. U. Brenner, M. Struzyna, J. Vygen, "BonnPlace: Placement of Leading-Edge Chips by Advanced Combinatorial Algorithms, IEEE TCAD 27(9) 2008,pp. 1607-20.
4. N. Buchbinder, J. Naor, The Design of Competitive Online Algorithms via a Primal-Dual Approach, NOW Publishers, 2009.
5. A. E. Caldwell, A. B. Kahng, I. L. Markov, "Can Recursive Bisection Alone Produce Routable Placements?" DAC 2000.
6. T. F. Chan et al, "mPL6: Enhanced Multilevel MixedSize Placement," ISPD 2006, pp. 212-214.
7. T.-C. Chen et al., "NTUPlace3: An Analytical Placer for Large-Scale Mixed-Size Designs With Preplaced Blocks and Density Constraints," IEEE TCAD 27(7) 2008, pp.1228-1240.
8. J. Cong, M. Romesis, J.R. Shinnerl, "Fast floorplanning by look-ahead enabled recursive bipartitioning," TCAD 25(9), 2006, pp. 1719-1732.
9. G. Goumas et al. "Understanding the Performance of Sparse Matrix-Vector Multiplication," Euromicro Int'l Conf. on Parallel, Distributed and Network-based Processing (PDP) 2008, pp. 283-292.
10. L. Hsu et al. "Exploring the Cache Design Space for Large Scale CMPs," ACM SIGARCH Computer Architecture News 2005, pp. 24-33.
11. B. Hu, M. Marek-Sadowska, "FAR: Fixed-points Addition & Relaxation Based Placement," ISPD 2005, pp. 161-166.
12. A. B. Kahng, Q. Wang, "A Faster Implementation of APlace," ISPD 2006, pp. 218-220.
13. A. A. Kennings, K. Vorwerk, "Force-Directed Methods for Generic Placement," IEEE TCAD 25(10), 2006, pp. 2076-2087.
14. G.-J. Nam, S. Reda, C. J. Alpert, P. Villarrubia, A. B. Kahng, "A Fast Hierarchical Quadratic Placement Algorithm," IEEE TCAD 25(4), 2006, pp. 678-691.
15. G.-J. Nam and J. Cong, Modern Circuit Placement: Best Practices and Results, Springer, 2007.
16. M.Pan, N.Viswanathan, C.Chu, "An Efflcient&Effective Detailed Placement Algorithm," ICCAD 2005, pp.48-55.
17. J. A. Roy, I. L. Markov, "ECO-System: Embracing the Change in Placement," IEEE TCAD 26(12) 2007, pp. 2173-2185.
18. J. A. Roy et al. "Capo: Robust and Scalable Opensource Min-cut Floorplacer," ISPD 2005, pp. 224-226.
19. Y. Saad, "Iterative Methods for Sparse Linear Systems," SIAM 2003.
20. P. Spindler, U. Schlichtmann, F. M. Johannes, "Kraftwerk2 - A Fast Force-Directed Quadratic Placement Approach Using an Accurate Net Model," IEEE TCAD 27(8) 2008, pp. 1398-1411.
21. L. N. Trefethen and D. Bau "Numerical Linear Algebra," SIAM 1997, pp. 296-298.
22. N.Viswanathan, M.Pan, C.Chu, "FastPlace 3.0: A Fast Multilevel Quadratic Placement Algorithm with Placement Congestion Control," ASPDAC 2007, pp. 135-140.
23. N. Viswanathan et al. "RQL: Global Placement via Relaxed Quadratic Spreading and Linearization," DAC 2007, pp. 453-458.
24. S. J. Wright, "Primal-Dual Interior-Point Methods," SIAM 1987.