메뉴 건너뛰기




Volumn , Issue , 2008, Pages 47-53

Abacus: Fast legalization of standard cell circuits with minimal movement

Author keywords

Dynamic programming; Legalization; Minimal movement; Standard cell circuits

Indexed keywords

DYNAMIC PROGRAMMING; ELECTRIC BATTERIES; MICROPROCESSOR CHIPS;

EID: 43349095254     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1353629.1353640     Document Type: Conference Paper
Times cited : (140)

References (29)
  • 1
    • 2942660384 scopus 로고    scopus 로고
    • Method and system for high speed detailed placement of cells within integrated circuit designs
    • U.S. Patent 6370673, April
    • Dwight Hill. Method and system for high speed detailed placement of cells within integrated circuit designs. U.S. Patent 6370673, April 2002.
    • (2002)
    • Hill, D.1
  • 6
    • 27944488404 scopus 로고    scopus 로고
    • Faster and better global placement by a new transportation algorithm
    • Ulrich Brenner and Markus Struzyna. Faster and better global placement by a new transportation algorithm. In ACM/IEEE Design Automation Conference (DAC), pages 591-596, 2005.
    • (2005) ACM/IEEE Design Automation Conference (DAC) , pp. 591-596
    • Brenner, U.1    Struzyna, M.2
  • 10
    • 0347409200 scopus 로고    scopus 로고
    • Ameya Agnihorti Mehmet Can Yildiz, Ateen Khatkhate, Ajita Mathur, Satoshi Ono, and Patrick H. Madden. Fractional cut: Improved recursive bisection placement. In IEEE/ACM International Conference on Computer-Aided Design (ICCAD), pages 307-31.0, 2003.
    • Ameya Agnihorti Mehmet Can Yildiz, Ateen Khatkhate, Ajita Mathur, Satoshi Ono, and Patrick H. Madden. Fractional cut: Improved recursive bisection placement. In IEEE/ACM International Conference on Computer-Aided Design (ICCAD), pages 307-31.0, 2003.
  • 18
    • 2942649186 scopus 로고    scopus 로고
    • On improving recursive bipartitioning-based placement
    • 03-1.4, Purdue University, December
    • Chen Li and Cheng-Kok Koh. On improving recursive bipartitioning-based placement. Technical Report TR-ECE 03-1.4, Purdue University, December 2003.
    • (2003) Technical Report TR-ECE
    • Li, C.1    Koh, C.-K.2
  • 19
    • 33745968360 scopus 로고    scopus 로고
    • Jason Cong and Min Xie. A. robust detailed placement for mixed-size ic design. In Asia and South Pacific Design Automation Conference, pages 188-194, 2006.
    • Jason Cong and Min Xie. A. robust detailed placement for mixed-size ic design. In Asia and South Pacific Design Automation Conference, pages 188-194, 2006.
  • 25
    • 10844238213 scopus 로고    scopus 로고
    • Object-oriented software for quadratic programming
    • March
    • Michael Gertz and Stephen Wright. Object-oriented software for quadratic programming. ACM Transactions on Mathematical Software, 29(1):58-81, March 2003.
    • (2003) ACM Transactions on Mathematical Software , vol.29 , Issue.1 , pp. 58-81
    • Gertz, M.1    Wright, S.2
  • 26
    • 43349084499 scopus 로고    scopus 로고
    • Xiaojian Yang, Bo-Kyung Choi, and Majid Sarrafzadeh. Routability-driven white space allocation for fixed-die standard-cell placement. In ACM/SIGDA International Symposium on Physical Design (ISPD), pages 4.2-49, 2002.
    • Xiaojian Yang, Bo-Kyung Choi, and Majid Sarrafzadeh. Routability-driven white space allocation for fixed-die standard-cell placement. In ACM/SIGDA International Symposium on Physical Design (ISPD), pages 4.2-49, 2002.
  • 28
  • 29
    • 34548295220 scopus 로고    scopus 로고
    • Fast and accurate routing demand estimation for efficient routability-driven placement
    • Peter Spindler and Frank M. Johannes. Fast and accurate routing demand estimation for efficient routability-driven placement. In Design, Automation and Test in Europe (DATE), pages 1226 1231, 2007.
    • (2007) Design, Automation and Test in Europe (DATE) , vol.1231 , pp. 1226
    • Spindler, P.1    Johannes, F.M.2


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