메뉴 건너뛰기




Volumn 18, Issue 7, 2010, Pages 1025-1035

Discrete buffer and wire sizing for link-based non-tree clock networks

Author keywords

Clock; discrete; links; non tree; sizing; support vector machine (SVM)

Indexed keywords

ACCURATE DELAY MODELS; BENCHMARK CIRCUIT; CIRCUIT-LEVEL SIMULATION; CLOCK NETWORK; CLOCK SKEWS; DISCRETE; HYBRID OPTIMIZATION; MACHINE-LEARNING; NON-TREE CLOCKS; POWER CONSUMERS; POWER DISSIPATION; POWER OVERHEAD; TWO STAGE; VARIATION TOLERANCES; WIRE SIZING;

EID: 77954087158     PISSN: 10638210     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVLSI.2009.2019088     Document Type: Article
Times cited : (20)

References (30)
  • 3
    • 29144441131 scopus 로고    scopus 로고
    • Improved algorithms for link based non-tree clock network for skew variability reduction
    • Apr.
    • A. Rajaram, D. Pan, and J. Hu, "Improved algorithms for link based non-tree clock network for skew variability reduction," in Proc. ACM Int. Symp. Phys. Des., Apr. 2005, pp. 55-62.
    • (2005) Proc. ACM Int. Symp. Phys. Des. , pp. 55-62
    • Rajaram, A.1    Pan, D.2    Hu, J.3
  • 5
    • 84886743533 scopus 로고    scopus 로고
    • Fast incremental link insertion in clock networks for skew variability reduction
    • Mar.
    • A. Rajaram and D. Z. Pan, "Fast incremental link insertion in clock networks for skew variability reduction," in Proc. IEEE Int. Symp. Quality Electron. Des., Mar. 2006, pp. 79-84.
    • (2006) Proc. IEEE Int. Symp. Quality Electron. Des. , pp. 79-84
    • Rajaram, A.1    Pan, D.Z.2
  • 7
    • 33745946821 scopus 로고    scopus 로고
    • Variation tolerant buffered clock network with cross links
    • Apr.
    • A. Rajaram and D. Z. Pan, "Variation tolerant buffered clock network with cross links," in Proc. ACM Int. Symp. Phys. Des., Apr. 2006, pp. 157-164.
    • (2006) Proc. ACM Int. Symp. Phys. Des. , pp. 157-164
    • Rajaram, A.1    Pan, D.Z.2
  • 9
    • 0029223026 scopus 로고
    • Buffer insertion and sizing under process variations for low power clock distribution
    • Jun.
    • J. G. Xi and W. W.-M. Dai, "Buffer insertion and sizing under process variations for low power clock distribution," in Proc. ACM/IEEE Des. Autom. Conf., Jun. 1995, pp. 491-496.
    • (1995) Proc. ACM/IEEE Des. Autom. Conf. , pp. 491-496
    • Xi, J.G.1    Dai, W.W.-M.2
  • 11
    • 0030246821 scopus 로고    scopus 로고
    • High-speed clock network sizing optimization based distributed RC and lossy RLC interconnect models
    • Sep.
    • Q. Zhu and W. W.-M. Dai, "High-speed clock network sizing optimization based distributed RC and lossy RLC interconnect models," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol.15, no.9, pp. 1106-1118, Sep. 1996.
    • (1996) IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. , vol.15 , Issue.9 , pp. 1106-1118
    • Zhu, Q.1    Dai, W.W.-M.2
  • 12
  • 13
    • 0038716746 scopus 로고    scopus 로고
    • Optimal minimum-delay/ area zero-skew clock tree wire-sizing in pseudo-polynomial time
    • Apr.
    • J.-L. Tsai, T.-H. Chen, and C. C.-P. Chen, "optimal minimum-delay/ area zero-skew clock tree wire-sizing in pseudo-polynomial time," in Proc. ACM Int. Symp. Phys. Des., Apr. 2003, pp. 166-173.
    • (2003) Proc. ACM Int. Symp. Phys. Des. , pp. 166-173
    • Tsai, J.-L.1    Chen, T.-H.2    Chen, C.C.-P.3
  • 14
    • 0029719540 scopus 로고    scopus 로고
    • Sizing of clock distribution networks for high performance CPU chips
    • Jun.
    • M. P. Desai, R. Cvijetic, and J. Jensen, "Sizing of clock distribution networks for high performance CPU chips," in Proc. ACM/IEEE Des. Autom. Conf., Jun. 1996, pp. 389-394.
    • (1996) Proc. ACM/IEEE Des. Autom. Conf. , pp. 389-394
    • Desai, M.P.1    Cvijetic, R.2    Jensen, J.3
  • 16
    • 0033702370 scopus 로고    scopus 로고
    • Zero-skew clock tree construction by simultaneous routing, wire sizing and buffer insertion
    • Apr.
    • I.-M. Liu, T.-L. Chou, A. Aziz, and D. F.Wong, "Zero-skew clock tree construction by simultaneous routing, wire sizing and buffer insertion," in Proc. ACM Int. Symp. Phys. Des., Apr. 2000, pp. 33-38.
    • (2000) Proc. ACM Int. Symp. Phys. Des. , pp. 33-38
    • Liu, I.-M.1    Chou, T.-L.2    Aziz, A.3    Wong, D.F.4
  • 21
    • 0031335168 scopus 로고    scopus 로고
    • Gate sizing for constrained delay/power/area optimization
    • Dec.
    • O. Coudert, "Gate sizing for constrained delay/power/area optimization," IEEE Trans. Very Large Scale Integr.(VLSI) Syst., vol.5, no.4, pp. 465-472, Dec. 1997.
    • (1997) IEEE Trans. Very Large Scale Integr.(VLSI) Syst. , vol.5 , Issue.4 , pp. 465-472
    • Coudert, O.1
  • 23
    • 0002714543 scopus 로고    scopus 로고
    • Making large-scale SVM learning practical
    • B. Scholkopf, C. Burges, and A. Smola, Eds. Cambridge, MA: MIT-Press
    • T. Joachims, "Making large-scale SVM learning practical," in Advances in Kernel Methods-Support Vector Learning, B. Scholkopf, C. Burges, and A. Smola, Eds. Cambridge, MA: MIT-Press, 1999.
    • (1999) Advances in Kernel Methods-Support Vector Learning
    • Joachims, T.1
  • 25
    • 0001189913 scopus 로고
    • Converting the 0-1 polynomial programming problem to a 0-1 linear program
    • Jan.-Feb.
    • F. Glover and L. Woolsey, "Converting the 0-1 polynomial programming problem to a 0-1 linear program," Oper. Res., vol.22, no.1, pp. 180-182, Jan.-Feb. 1974.
    • (1974) Oper. Res. , vol.22 , Issue.1 , pp. 180-182
    • Glover, F.1    Woolsey, L.2
  • 26
    • 84990479742 scopus 로고
    • An efficient heuristic procedure for partitioning graphs
    • Feb.
    • B. W. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs," Bell Syst. Techn. J., vol.49, no.2, pp. 291-307, Feb. 1970.
    • (1970) Bell Syst. Techn. J. , vol.49 , Issue.2 , pp. 291-307
    • Kernighan, B.W.1    Lin, S.2
  • 27
    • 77954083378 scopus 로고    scopus 로고
    • GSRC Bookshelf,Univ. California,San Diego, BST," [Online]. Available
    • GSRC Bookshelf, Univ. California, San Diego, "Bounded-skew clock tree routing, BST," [Online]. Available: http://vlsicad.ucsd.edu/GSRC/ bookshelf/slot/BST
    • Bounded-skew Clock Tree Routing
  • 29
    • 33748118880 scopus 로고    scopus 로고
    • Constrained placement by multilevel optimization
    • VLSI CAD Lab.,UCLA Los Angeles CA, [Online]. Available
    • VLSI CAD Lab., UCLA, Los Angeles, CA, "Constrained placement by multilevel optimization, CPMO," 2003. [Online]. Available: http:// ballade.cs.ucla.edu/cpmo/
    • (2003) CPMO
  • 30


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