Flow-based Partitioning and Fast Global Placement in Chip Design

[1]  László Lovász,et al.  Random Walks on Graphs: A Survey , 1993 .

[2]  J. Stoer,et al.  Introduction to Numerical Analysis , 2002 .

[3]  Cheng-Kok Koh,et al.  Recursive Function Smoothing of Half-Perimeter Wirelength for Analytical Placement , 2007, 8th International Symposium on Quality Electronic Design (ISQED'07).

[4]  Ulf Schlichtmann,et al.  Kraftwerk2—A Fast Force-Directed Quadratic Placement Approach Using an Accurate Net Model , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[5]  Jens Vygen,et al.  Geometric quadrisection in linear time, with application to VLSI placement , 2005, Discret. Optim..

[6]  G. Karypis,et al.  Multilevel k-way hypergraph partitioning , 1999, Proceedings 1999 Design Automation Conference (Cat. No. 99CH36361).

[7]  Sachin S. Sapatnekar,et al.  Handbook of Algorithms for Physical Design Automation , 2008 .

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Patrick H. Madden,et al.  Fast Analytic Placement using Minimum Cost Flow , 2007, 2007 Asia and South Pacific Design Automation Conference.

[10]  Jens Vygen,et al.  BonnPlace: Placement of Leading-Edge Chips by Advanced Combinatorial Algorithms , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[11]  David Z. Pan,et al.  Diffusion-based placement migration , 2005, Proceedings. 42nd Design Automation Conference, 2005..

[12]  Nikhil Srivastava,et al.  Graph Sparsification by Effective Resistances , 2011, SIAM J. Comput..

[13]  David Z. Pan,et al.  DPlace2.0: A stable and efficient analytical placement based on diffusion , 2008, 2008 Asia and South Pacific Design Automation Conference.

[14]  C. Villani.  Optimal Transport: Old and New , 2008 .

[15]  M. Randic,et al.  Resistance distance , 1993 .

[16]  Chung-Kuan Cheng,et al.  Unified quadratic programming approach for mixed mode placement , 2005, ISPD '05.

[17]  Cheng-Kok Koh,et al.  Recursive bisection based mixed block placement , 2004, ISPD '04.

[18]  Cheng-Kok Koh,et al.  A study of routability estimation and clustering in placement , 2009, 2009 IEEE/ACM International Conference on Computer-Aided Design - Digest of Technical Papers.

[19]  Cynthia Dwork,et al.  Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008 , 2008, STOC.

[20]  Andrew A. Kennings,et al.  Engineering details of a stable force-directed placer , 2004, IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004..

[21]  S. Hoffmann,et al.  OpenMP: Eine Einfhrung in die parallele Programmierung mit C/C++ (Informatik im Fokus) , 2008 .

[22]  Vasant B. Rao,et al.  Delay Analysis of the Distributed RC Line , 1995, 32nd Design Automation Conference.

[23]  Yao-Wen Chang,et al.  Essential Issues in Analytical Placement Algorithms , 2009, IPSJ Trans. Syst. LSI Des. Methodol..

[24]  Anthony Vannelli,et al.  Using Eigenvectors to Partition Circuits , 2006, INFORMS J. Comput..

[25]  Yongqiang Lyu,et al.  An efficient quadratic placement based on search space traversing technology , 2007, Integr..

[26]  D. F. Wong,et al.  Simulated Annealing for VLSI Design , 1988 .

[27]  E.S. Kuh,et al.  PROUD: a sea-of-gates placement algorithm , 1988, IEEE Design & Test of Computers.

[28]  Ulrich Brenner,et al.  An effective congestion driven placement framework , 2002, ISPD '02.

[29]  Radu Marculescu,et al.  Architecting voltage islands in core-based system-on-a-chip designs , 2004, Proceedings of the 2004 International Symposium on Low Power Electronics and Design (IEEE Cat. No.04TH8758).

[30]  L. V. Kantorovich,et al.  Mathematical Methods of Organizing and Planning Production , 1960 .

[31]  Christian Szegedy,et al.  A morphing approach to address placement stability , 2007, ISPD '07.

[32]  E. Cuthill,et al.  Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.

[33]  Hidetoshi Onodera,et al.  Branch-and-bound placement for building block layout , 1991, 28th ACM/IEEE Design Automation Conference.

[34]  Jinjun Xiong,et al.  Constraint driven I/O planning and placement for chip-package co-design , 2006, Asia and South Pacific Conference on Design Automation, 2006..

[35]  Vitaly Osipov,et al.  n-Level Graph Partitioning , 2010, ESA.

[36]  Prabhakar Raghavan,et al.  The electrical resistance of a graph captures its commute and cover times , 2005, computational complexity.

[37]  David Harel,et al.  On Clustering Using Random Walks , 2001, FSTTCS.

[38]  Kia Bazargan,et al.  Multi-objective circuit partitioning for cutsize and path-based delay minimization , 2002, IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002..

[39]  Mustafa Yilmaz,et al.  Genetic clustering of social networks using random walks , 2007, Comput. Stat. Data Anal..

[40]  Malgorzata Marek-Sadowska,et al.  Fine granularity clustering for large scale placement problems , 2003, ISPD '03.

[41]  Robert E. Tarjan,et al.  Improved Algorithms for Bipartite Network Flow , 1994, SIAM J. Comput..

[42]  Andrew B. Kahng,et al.  A fast hierarchical quadratic placement algorithm , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[43]  David M. Warme,et al.  Exact Algorithms for Plane Steiner Tree Problems: A Computational Study , 2000 .

[44]  李幼升,et al.  Ph , 1989 .

[45]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[46]  Jarrod A. Roy,et al.  Capo: robust and scalable open-source min-cut floorplacer , 2005, ISPD '05.

[47]  Jens Vygen,et al.  New theoretical results on quadratic placement , 2007, Integr..

[48]  Frank M. Johannes,et al.  Generic global placement and floorplanning , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[49]  Konrad Doll,et al.  Analytical placement: a linear or a quadratic objective function? , 1991, 28th ACM/IEEE Design Automation Conference.

[50]  Jason Cong,et al.  Highly Efficient Gradient Computation for Density-Constrained Analytical Placement , 2008, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[51]  Kenneth M. Hall.  An r-Dimensional Quadratic Placement Algorithm , 1970 .

[52]  M. Marek-Sadowska,et al.  mFAR: fixed-points-addition-based VLSI placement algorithm , 2005, ISPD '05.

[53]  Paul S. Zuchowski,et al.  Issues and strategies for the physical design of system-on-a-chip ASICs , 2002, IBM J. Res. Dev..

[54]  Joseph R. Shinnerl,et al.  mPL6: enhanced multilevel mixed-size placement , 2006, ISPD '06.

[55]  Bjarne Stroustrup,et al.  The C++ Programming Language: Special Edition , 2000 .

[56]  Yao-Wen Chang,et al.  NTUplace3: An Analytical Placer for Large-Scale Mixed-Size Designs With Preplaced Blocks and Density Constraints , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[57]  Ulrich Brenner,et al.  Faster and better global placement by a new transportation algorithm , 2005, Proceedings. 42nd Design Automation Conference, 2005..

[58]  Mo Chen,et al.  Clustering via Random Walk Hitting Time on Directed Graphs , 2008, AAAI.

[59]  Patrick H. Madden,et al.  Recursive bisection placement: feng shui 5.0 implementation details , 2005, ISPD '05.

[60]  W. C. Elmore.  The Transient Response of Damped Linear Networks with Particular Regard to Wideband Amplifiers , 1948 .

[61]  Dennis W. Shaklee,et al.  Proceedings of the 25th ACM/IEEE Design Automation Conference , 1988, DAC 1988.

[62]  Bradford Nichols,et al.  Pthreads programming - a POSIX standard for better multiprocessing , 1996 .

[63]  Chris C. N. Chu,et al.  FastPlace 3.0: A Fast Multilevel Quadratic Placement Algorithm with Placement Congestion Control , 2007, 2007 Asia and South Pacific Design Automation Conference.

[64]  James B. Orlin.  A Faster Strongly Polynomial Minimum Cost Flow Algorithm , 1993, Oper. Res..

[65]  Louise Trevillyan,et al.  Logical and physical restructuring of fan-in trees , 2010, ISPD '10.

[66]  Charles M. Fiduccia,et al.  A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.

[67]  Jens Vygen.  Plazierung im VLSI-Design und ein zweidimensionales Zerlegungsproblem , 1996 .

[68]  David Z. Pan,et al.  Diffusion-Based Placement Migration With Application on Legalization , 2007, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[69]  Dirk Müller,et al.  Optimizing yield in global routing , 2006, ICCAD '06.

[70]  Gi-Joon Nam,et al.  The ISPD2005 placement contest and benchmark suite , 2005, ISPD '05.

[71]  Peter G. Doyle,et al.  Random Walks and Electric Networks: REFERENCES , 1987 .

[72]  Moses Charikar,et al.  A divide and conquer algorithm for d-dimensional arrangement , 2007, SODA '07.

[73]  Jon M. Kleinberg,et al.  An Impossibility Theorem for Clustering , 2002, NIPS.

[74]  Igor L. Markov,et al.  Consistent placement of macro-blocks using floorplanning and standard-cell placement , 2002, ISPD '02.

[75]  Anthony Vannelli,et al.  Engineering details of a stable force-directed placer , 2004, ICCAD 2004.

[76]  J. L. Batra,et al.  A parametric algorithm for convex cost network flow and related problems , 1984 .

[77]  Yao-Wen Chang,et al.  NTUplace: a ratio partitioning based placement algorithm for large-scale mixed-size designs , 2005, ISPD '05.

[78]  Peter J. Osler.  Placement driven synthesis case studies on two sets of two chips: hierarchical and flat , 2004, ISPD '04.

[79]  J. Vygen,et al.  Worst‐case ratios of networks in the rectilinear plane , 2001 .

[80]  François Fouss,et al.  Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation , 2007, IEEE Transactions on Knowledge and Data Engineering.

[81]  Chris C. N. Chu,et al.  SafeChoice: a novel clustering algorithm for wirelength-driven placement , 2010, ISPD '10.

[82]  A. B. Rami Shani,et al.  Matrices: Methods and Applications , 1992 .

[83]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[84]  Alberto L. Sangiovanni-Vincentelli,et al.  TimberWolf3.2: A New Standard Cell Placement and Global Routing Package , 1986, 23rd ACM/IEEE Design Automation Conference.

[85]  Jianhua Li,et al.  Net cluster: a net-reduction based clustering preprocessing algorithm , 2006, ISPD '06.

[86]  Jens Vygen,et al.  Worst-case ratios of networks in the rectilinear plane , 2001, Networks.

[87]  Jens Vygen,et al.  Legalizing a placement with minimum total movement , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[88]  M. Queyranne.  Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems , 1986 .

[89]  David S. Johnson,et al.  The Complexity of Computing Steiner Minimal Trees , 1977 .

[90]  Manjunatha K Prasad,et al.  Generalized Inverse of a Matrix and its Applications , 2011 .

[91]  Paul G. Villarrubia,et al.  Placement , 2008, Handbook of Algorithms for Physical Design Automation.

[92]  Andrew B. Kahng,et al.  A faster implementation of APlace , 2006, ISPD '06.

[93]  Jens Vygen,et al.  Algorithms for large-scale flat placement , 1997, DAC.

[94]  Shashi Shekhar,et al.  Multilevel hypergraph partitioning: applications in VLSI domain , 1999, IEEE Trans. Very Large Scale Integr. Syst..

[95]  Karel Driesen,et al.  The direct cost of virtual function calls in C++ , 1996, OOPSLA '96.

[96]  Dennis J.-H. Huang,et al.  Multilevel Circuit Partitioning , 1997, Proceedings of the 34th Design Automation Conference.

[97]  Andrew B. Kahng,et al.  A new approach to effective circuit clustering , 1992, ICCAD.

[98]  Rob A. Rutenbar,et al.  Mixed-size placement with fixed macrocells using grid-warping , 2007, ISPD '07.

[99]  Jens Vygen,et al.  Analytical Methods in Placement , 2008, Handbook of Algorithms for Physical Design Automation.

[100]  Chris C. N. Chu,et al.  RQL: Global Placement via Relaxed Quadratic Spreading and Linearization , 2007, 2007 44th ACM/IEEE Design Automation Conference.

[101]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[102]  Majid Sarrafzadeh,et al.  Dragon2000: standard-cell placement tool for large industry circuits , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[103]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[104]  Hanan Samet,et al.  The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

[105]  Andrew B. Kahng,et al.  Faster minimization of linear wirelength for global placement , 1997, ISPD '97.

[106]  Arie Tamir,et al.  Obnoxious Facility Location on Graphs , 1991, SIAM J. Discret. Math..

[107]  Charles U. Martel,et al.  Fast Algorithms for Bipartite Network Flow , 1987, SIAM J. Comput..

[108]  Andrew B. Kahng,et al.  A semi-persistent clustering technique for VLSI circuit placement , 2005, ISPD '05.

[109]  Chung-Kuan Cheng,et al.  The Orientation of Modules Based on Graph Decomposition , 1991, IEEE Trans. Computers.

[110]  Georg Sigl,et al.  GORDIAN: VLSI placement by quadratic programming and slicing optimization , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[111]  Jason Cong,et al.  Edge separability-based circuit clustering with application to multilevel circuit partitioning , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[112]  Jason Cong,et al.  Random walks for circuit clustering , 1991, [1991] Proceedings Fourth Annual IEEE International ASIC Conference and Exhibit.

[113]  A. Zinober.  Matrices: Methods and Applications , 1992 .

[114]  W. Gangbo,et al.  Optimal maps in Monge's mass transport problem , 1995 .