메뉴 건너뛰기




Volumn , Issue , 2009, Pages 80-84

Parallel genetic algorithm for VLSI standard cell placement

Author keywords

Genetic algorithm; Parallel computing; Placement; VLSI physical design

Indexed keywords

BENCH MARKS; COMPUTATIONAL TIME; PARALLEL COMPUTING; PARALLEL GA; PARALLEL GENETIC ALGORITHMS; PARALLEL TECHNIQUES; PLACEMENT; SOLUTION QUALITY; STANDARD-CELL PLACEMENT; VLSI PHYSICAL DESIGN; WIRE LENGTH;

EID: 77949294580     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACT.2009.30     Document Type: Conference Paper
Times cited : (13)

References (14)
  • 5
    • 33749581016 scopus 로고    scopus 로고
    • An Improved Genetic Algorithm for Cell Placement
    • 4113, pp
    • Guofang Nan, "An Improved Genetic Algorithm for Cell Placement" ICIC 2006, LNCS 4113, pp. 523 - 532, 2006.
    • (2006) LNCS , vol.ICIC 2006 , pp. 523-532
    • Nan, G.1
  • 7
    • 0036973748 scopus 로고    scopus 로고
    • A genetic Algorithm for Mixed Macro and Standard Cell Placement
    • Manikas, T. W., Mickle, M. H. "A genetic Algorithm for Mixed Macro and Standard Cell Placement". Circuits and Systems, 2 (2002) 4-7.
    • (2002) Circuits and Systems , vol.2 , pp. 4-7
    • Manikas, T.W.1    Mickle, M.H.2
  • 8
    • 77949301687 scopus 로고    scopus 로고
    • Genetic algorithms for VLSI design, layout & test automation
    • M
    • Pinaki Mazumder and Elizabeth.M, "Genetic algorithms for VLSI design, layout & test automation" Prentice Hall PTR, 1999.
    • (1999) Prentice Hall PTR
    • Mazumder, P.1    Elizabeth2
  • 9
    • 0018480537 scopus 로고
    • A Forced Directed Component Placement Procedure for Printed Circuit Boards
    • Quinn, J. R., Breuer, M. A. "A Forced Directed Component Placement Procedure for Printed Circuit Boards". IEEE Trans. CAS, 26 (6) (1979) 377-388.
    • (1979) IEEE Trans. CAS , vol.26 , Issue.6 , pp. 377-388
    • Quinn, J.R.1    Breuer, M.A.2
  • 10
    • 26844450194 scopus 로고    scopus 로고
    • Improving Min-cut Placement for VLSI Using Analytical Techniques
    • Saurabh, A., Igor, M., Villarrubia, P. G. "Improving Min-cut Placement for VLSI Using Analytical Techniques", IBM ACAS Conference, (2003) 55-62.
    • (2003) IBM ACAS Conference , pp. 55-62
    • Saurabh, A.1    Igor, M.2    Villarrubia, P.G.3
  • 13
    • 0038420032 scopus 로고    scopus 로고
    • Sait.S.M, El-Maleh.A.H and Al-Abaji.R.H, General iterative heuristics for VLSI multiobjective partitioning in Proc. International Symposium on Circuits and Systems ISCAS apos: 03, may 2003 5, Issue, 25-28 pp. V-497-V-500.
    • Sait.S.M, El-Maleh.A.H and Al-Abaji.R.H, "General iterative heuristics for VLSI multiobjective partitioning" in Proc. International Symposium on Circuits and Systems ISCAS apos: 03, may 2003 Vol 5, Issue, 25-28 pp. V-497-V-500.
  • 14
    • 0025568135 scopus 로고
    • A New Min-cut Placement Algorithm for Timing Assurance Layout Design Meeting Net Length Constrain
    • Terai, M., Takahashi, K., Sato, K. "A New Min-cut Placement Algorithm for Timing Assurance Layout Design Meeting Net Length Constrain". Design Automation Conference,(1990) 96-102.
    • (1990) Design Automation Conference , pp. 96-102
    • Terai, M.1    Takahashi, K.2    Sato, K.3


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