메뉴 건너뛰기




Volumn , Issue , 2001, Pages 41-48

Multi-terminal nets do change conventional wire length distribution models

Author keywords

Multi terminal nets; Rent's rule; Wire length estimation

Indexed keywords

ELECTRIC WIRE; ESTIMATION; GATES (TRANSISTOR); INTERCONNECTION NETWORKS; TREES (MATHEMATICS);

EID: 0035789304     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (8)

References (18)
  • 1
    • 0031685684 scopus 로고    scopus 로고
    • The ISPD circuit benchmark suite
    • ACM
    • C. J. Alpert. The ISPD circuit benchmark suite. In Proc. Intl. Symp. on Physical Design. ACM, 1998. http://vlsicad.cs.ucla.edu/̃cheese/benchmarks.html.
    • (1998) Proc. Intl. Symp. on Physical Design
    • Alpert, C.J.1
  • 5
    • 0032026510 scopus 로고    scopus 로고
    • A stochastic wire-length distribution for gigascale integration (GSI) - PART I: Derivation and validation
    • 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, vol. 45 (no. 3): pages 580-589, 1998.
    • (1998) IEEE Trans. on Electron Devices , vol.45 , Issue.3 , pp. 580-589
    • Davis, J.A.1    De, V.K.2    Meindl, J.D.3
  • 6
    • 0018453798 scopus 로고
    • Placement and average interconnection lengths of computer logic
    • W. E. Donath. Placement and average interconnection lengths of computer logic. IEEE Trans. Circuits & Syst., vol. CAS-26: pages 272-277, 1979.
    • (1979) IEEE Trans. Circuits & Syst. , vol.CAS-26 , pp. 272-277
    • Donath, W.E.1
  • 7
    • 0015206785 scopus 로고
    • On a pin versus block relationship for partitions of logic graphs
    • B. S. Landman and R. L. Russo. On a pin versus block relationship for partitions of logic graphs. IEEE Trans. on Comput., vol. C-20: pages 1469-1479, 1971.
    • (1971) IEEE Trans. on Comput. , vol.C-20 , pp. 1469-1479
    • Landman, B.S.1    Russo, R.L.2
  • 9
    • 18744428539 scopus 로고    scopus 로고
    • Pin count prediction in ratio cut partitioning for VLSI and ULSI
    • M. A. Bayonmi, editor, IEEE, May
    • D. Stroobandt. Pin count prediction in ratio cut partitioning for VLSI and ULSI. In M. A. Bayonmi, editor, Proc. IEEE Intl. Symp. on Circuits and Systems, pages VI-262-VI-265. IEEE, May 1999.
    • (1999) Proc. IEEE Intl. Symp. on Circuits and Systems
    • Stroobandt, D.1
  • 12
    • 0031673410 scopus 로고    scopus 로고
    • On the characterization of multi-point nets in electronic designs
    • M. A. Bayoumi and G. Jullien, editors, IEEE Computer Society Press, February
    • D. Stroobandt and F. J. Kurdahi. On the characterization of multi-point nets in electronic designs. In M. A. Bayoumi and G. Jullien, editors, Proc. 8th Great Lakes Symp. on VLSI, pages 344-350. IEEE Computer Society Press, February 1998.
    • (1998) Proc. 8th Great Lakes Symp. on VLSI , pp. 344-350
    • Stroobandt, D.1    Kurdahi, F.J.2
  • 17
    • 0041165532 scopus 로고    scopus 로고
    • Euclidean Steiner minimum trees: An improved exact algorithm
    • P. Winter and M. Zachariasen. Euclidean Steiner minimum trees: An improved exact algorithm. Networks, vol. 30: pages 149-166, 1997.
    • (1997) Networks , vol.30 , pp. 149-166
    • Winter, P.1    Zachariasen, M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.