A. E. Caldwell
A. B. Kahng
I. L. Markov
- 1.C. J. Alpert, "Partitioning Benchmarks for VLS! CAD Cnmmunity", Web page, http://vlsicad.cs.ucla.eduFcheese/benchmarks.html (see also the parent home page for partitioning codes).Google Scholar
- 2.C. J. Alpert, T. Chart, D. J.-H. Huang, I. Markov and K. Yah, "Quadratic Placement Revisited", Proc. ACM/IEEE Design Automation Conference, 1997, pp. 752-757. Google ScholarDigital Library
- 3.C.J. Alpert, J.-H. Huang and A. B. Kahng,"Multilevel Circuit Partitioning", ACM/IEEE Design Automation Conference, pp. 530-533. Google ScholarDigital Library
- 4.C.J. Alpert and A. B. Kahng, "Recent Directions in Netlist Partitioning: A Survey", Integration, 19(1995) 1-81. Google ScholarDigital Library
- 5.J. Clausen and J. L. Trfiff, "Do Inherently Sequential Branchand-Bound Algorithms Exist?", Parallel Processing Letters 4(1-2) (1994). pp. 3-13.Google ScholarCross Ref
- 6.J. A. Davis, V. K. De and J. D. Meindl, "A Stochastic W'ure-Length Distribution for Gigascale Integration (GSI)- Part I: Derivation and Validation", IEEE Transactions on Electron Devices, 45(3) (1998), pp. 580-589.Google ScholarCross Ref
- 7.A. E. Dunlop and B. W. Kernighan, "'A Procedure for Placement of Standard Cell VLSI Circuits", IEEE Transactions on Computer- Aided Design 4(l) ( 1985), pp. 92-98Google ScholarDigital Library
- 8.S. Dutt and W. Deng, "VLSI Circuit Partitioning by Cluster-Removal Using Iterative Improvement Techniques", Proc. IEEE International Conference on Computer-Aided Design, i996, pp. z~4-zt~ Google ScholarDigital Library
- 9.S. Dutt and H. Thcny, "Partitioning Around Roadblocks: Tackling i~nn~h~inta Vl/~fh {nt~rmacllat~ ll~l~vnfinne'" l~wme II~I~'I~ l~tarnt~. tional Conference on Computer-Aided Design, 1997, pp. 350-355. Google ScholarDigital Library
- 10.C. M. Fiduccia and R. M. Matthcyses, "A Linear Time Heuristic for Improving Network Partitions", Proc. ACM/IEEE Design Automation Conference, 1982, pp. 175-181. Google ScholarDigital Library
- 11.L. Hagen, J. H. Huang and A. B. Kahng, "Quantified Suboptimaiity of VLSI Layout Heuristics", Proc. ACM/IEEE Design Automation Conference, 1995, pp. 216-221. Google ScholarDigital Library
- 12.G. Karypis, R. Aggatwal, V. Kumar, and S. Shekhax, "Multilevel Hypergraph Partitioning: Applications in VLSI Design", Proc. ACM/IEEE Design Automation Conference, 1997, pp. 526-529. Google ScholarDigital Library
- 13.B. W. Kernighan and S. Lin, "An Efficient Heuristic Proce, dure for Partitioning Graphs" Bell System Tec. Journal 49 (1970) pp. 291- 307.Google Scholar
- 14.Jo Kleinhan~. G; Sig|, E Joh~ne.s_ and K. An_m~_ich0 "GORDIAN: VLSI Placement by Quadratic Programming and Slicing Optimization", IEEE Trans. on Computer Aided Design 10(3) (1991), pp. 356- .7U.1.Google ScholarDigital Library
- 15.R. H. J. M. Otten, "Global Wires Hm'mfuW', Prec. ACM/IEEE lntL Sympo on Physical Design, ! 998, ppo ! 04- !09. Google ScholarDigital Library
- 16.R. H. J. M. Otten and R. K. Brayton, "Planning for Performance", Proc. AC~EEE Design Auwmation Conference, 1998, pp. 122-127. Google ScholarDigital Library
- 17.R. Preis and R. Diekmann, The PARTY Partitioning-Library User Guide, Version 1.1, University of Paded~m, September 1996.Google Scholar
- 18.H. D. Simon and S.-H. Teng, "How Good is Recursive BisectionS', SIAM J. Scientific Computing 18(5) (1997), pp. 1436-1445. Google ScholarDigital Library
- 19.D. Stroobandt, "Improving Donath's Technique for Estimating the Average Interconne~on Length in Computer logic", ELIS technical report, Royal University of Ghent, June 1996.Google Scholar
- 20.L. Trotter, "PERM (Algorithm 115)", Communications of the ACM 5 (1962).Google Scholar
- 21.R. S. Tsay and E. Kuh, "A Unified Approach to Partitioning and Placement", IEEE Trans. on Circuits and Systems, 38(5) (1991), pp.Google ScholarCross Ref
Index Terms
- Optimal partitioners and end-case placers for standard-cell layout
Recommendations
Optimal partitioners and end-case placers for standard-cell layout
We study alternatives to classic Fiduccia-Mattheyses (FM)-based partitioning algorithms in the context of end-case processing for top-down standard-cell placement. While the divide step in the top-down divide and conquer is usually performed ...
Routability driven white space allocation for fixed-die standard-cell placement
ISPD '02: Proceedings of the 2002 international symposium on Physical designThe use of white space in fixed-die standard-cell placement is an effective way to improve routability. In this paper, we present a white space allocation approach that dynamically assigns white space according to the congestion distribution of the ...
Consistent placement of macro-blocks using floorplanning and standard-cell placement
ISPD '02: Proceedings of the 2002 international symposium on Physical designWhile a number of recent works address large-scale standard-cell placement, they typically assume that all macros are fixed. Floorplanning techniques are very good at handling macros, but do not scale to hundreds of thousands of placeable objects. ...
Comments