On partitioning vs. placement rent properties

2001 International Workshop on System-Level Interconnect Prediction (SLIP 2001)

Volumn , Issue , 2001, Pages 33-40

  Verplaetse, Peter ^a   Dambre, J ^b   Stroobandt, Dirk ^a   Van Campenhout, J ^b  

^a FUND FOR SCIENTIFIC RESEARCH   (Belgium)

^b NONE

Author keywords

Estimation; Partitioning; Placement; Rent's rule; Wire length distribution

Indexed keywords

ALGORITHMS; EMBEDDED SYSTEMS; ESTIMATION; MATHEMATICAL MODELS; PROBABILITY;

PARTITIONING;

INTEGRATED CIRCUIT LAYOUT;

EID: 0035788941     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/368640.368665     Document Type: Conference Paper

References (16)

1. A. E. Caldwell, K. A. B., and M. I. L. Can recursive bisection produce routable placements? In Proc. Design Automation Conf., pages 477-482, June 2000.
2. P. Christie and D. Stroobandt. The interpretation and application of Rent's rule. IEEE Trans. on VLSI Systems, Special Issue on System-Level Interconnect Prediction, 8(6):639-648, December 2000.
3. J. Dambre, P. Verplaetse, D. Stroobandt, and J. Van Campenhout. On Rent's rule for rectangular regions. In Proc. of Intl. Workshop on System-Level Interconnect Prediction, March 2001.
4. J. A. Davis, V. K. De, and J. D. Meindl. A stochastic wire-length distribution for gigascale integration (GSI) -PART I: Derivation and validation. IEEE Trans. on Electron Devices, 45(3):580-589, March 1998.
5. W. E. Donath. Wire length distribution for placements of computer logic. IBM J. of Research and Development, 25:152-155, 1981.
6. G. Karypis and V. Kumar. hMetis: A Hypergraph Partitioning Package, November 1998. Available at: http://www-users.cs.umn.edu/̃karypis/metis/hmetis/main.shtml.
7. B. S. Landman and R. L. Russo. On a pin versus block relationship for partitions of logic graphs. IEEE Trans. on Comput., C-20:1469-1479, 1971.
8. M. Sarrafzadeh and M. Wang. NRG: Global and detailed placement. In Proc. IEEE Intl. Conf. on Computer-Aided Design, pages 532-537, November 1997.
9. D. Stroobandt. Analytical methods for a priori wire length estimates in computer systems, November 1998. Ph.D. thesis (translated from Dutch), University of Ghent, Faculty of Applied Sciences.
10. D. Stroobandt. On an efficient method for estimating the interconnection complexity of designs and on the existence of region III in Rent's rule. In Proc. 9th Great Lakes Symposium on VLSI, pages 330-331, March 1999.
11. D. Stroobandt, P. Verplaetse, and J. Van Campenhout. Generating synthetic benchmark circuits for evaluating CAD tools. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems., 19(9):1011-1022, September 2000.
12. P. Suarism and G. Kedem. An algorithm for quadrisection and its application to standard cell placement. IEEE Trans. on Circuits & Systems, 35(3):294-303, March 1988.
13. W. Sun and C. Sechen. Efficient and effective placement for very large circuits. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 14(3):349-359, March 1995.
14. P. Verplaetse. A stochastic model for the interconnection topology of digital circuits. Technical Report PARIS 00-07, Ghent University, Belgium, ELIS Department, December 2000. Submitted to IEEE Trans. on Very Large Scale Integration (VLSI) Systems.
15. M. Wang, X. Yang, and M. Sarrafzadeh. Dragon2000: Standard-cell placement tool for large industry circuits. In Proc. of Intl. Conf. on Computer-Aided Design, pages 260-263, November 2000.
16. X. Yang, M. Wang, K. Eguro, and M. Sarrafzadeh. A snap-on placement tool. In Proc. of Intl. Symp on Physical Design, pages 153-158, April 2000.