메뉴 건너뛰기




Volumn , Issue , 2012, Pages 79-86

Keep it straight: Teaching placement how to better handle designs with datapaths

Author keywords

Datapath; Physical design; Placement

Indexed keywords

COMPUTER AIDED DESIGN; COMPUTER CIRCUITS;

EID: 84860247104     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2160916.2160935     Document Type: Conference Paper
Times cited : (22)

References (26)
  • 2
    • 0031643951 scopus 로고    scopus 로고
    • Practical experiences with standard-cell based datapath design tools
    • P. Ienne and A. GrieBing, "Practical experiences with standard-cell based datapath design tools," in Proceedings of DAC, pp. 396-401, 1998.
    • (1998) Proceedings of DAC , pp. 396-401
    • Ienne, P.1    Griebing, A.2
  • 8
    • 0019478261 scopus 로고
    • Efficient algorithm for the two-dimensional placement problem in electrical circuit layout
    • S. Goto, "An efficient algorithm for the two-dimensional placement problem in electrical circuit layout," Circuits and Systems, IEEE Transactions on, vol. 28, pp. 12 - 18, jan 1981. (Pubitemid 11466333)
    • (1981) IEEE transactions on circuits and systems , vol.CAS-28 , Issue.1 , pp. 12-18
    • Goto Satoshi1
  • 13
    • 34547326796 scopus 로고    scopus 로고
    • FastPlace 3.0: A fast multilevel quadratic placement algorithm with placement congestion control
    • N. Viswanathan, M. Pan, and C. Chu, "FastPlace 3.0: A fast multilevel quadratic placement algorithm with placement congestion control," in Proceedings of ASPDAC, pp. 135-140, 2007.
    • (2007) Proceedings of ASPDAC , pp. 135-140
    • Viswanathan, N.1    Pan, M.2    Chu, C.3
  • 14
    • 46149088493 scopus 로고    scopus 로고
    • A high-quality mixed-size analytical placer considering preplaced blocks and density constraints
    • T.-C. Chen, Z.-W. Jiang, T.-C. Hsu, H.-C. Chen, and Y.-W. Chang, "A high-quality mixed-size analytical placer considering preplaced blocks and density constraints," in Proc. ICCAD, pp. 187-192, 2006.
    • (2006) Proc. ICCAD , pp. 187-192
    • Chen, T.-C.1    Jiang, Z.-W.2    Hsu, T.-C.3    Chen, H.-C.4    Chang, Y.-W.5
  • 16
    • 78650896423 scopus 로고    scopus 로고
    • SimPL: An effective placement algorithm
    • M.-C. Kim, D.-J. Lee, and I. L. Markov, "simPL: an effective placement algorithm," in Proc. ICCAD, pp. 649-656, 2010.
    • (2010) Proc. ICCAD , pp. 649-656
    • Kim, M.-C.1    Lee, D.-J.2    Markov, I.L.3
  • 17
    • 84855803215 scopus 로고    scopus 로고
    • Congestion analysis for global routing via integer programming
    • H. Shojaei, A. Davoodi, and J. Linderoth, "Congestion analysis for global routing via integer programming," in Proc. ICCAD, pp. 256-262, 2011.
    • (2011) Proc. ICCAD , pp. 256-262
    • Shojaei, H.1    Davoodi, A.2    Linderoth, J.3
  • 19
    • 47849103959 scopus 로고    scopus 로고
    • Kraftwerk2 - A fast force-directed quadratic placement approach using an accurate net model
    • P. Spindler, U. Schlichtmann, and F. M. Johannes, "Kraftwerk2 - a fast force-directed quadratic placement approach using an accurate net model," IEEE TCAD, vol. 27, no. 8, pp. 1398-1411, 2008.
    • (2008) IEEE TCAD , vol.27 , Issue.8 , pp. 1398-1411
    • Spindler, P.1    Schlichtmann, U.2    Johannes, F.M.3
  • 21
    • 0032595826 scopus 로고    scopus 로고
    • Extraction of functional regularity in datapath circuits
    • A. Chowdhary, S. Kale, P. Saripella, N. Sehgal, and R. Gupta, "Extraction of functional regularity in datapath circuits," IEEE TCAD, vol. 18, no. 9, pp. 1279-1296, 1999.
    • (1999) IEEE TCAD , vol.18 , Issue.9 , pp. 1279-1296
    • Chowdhary, A.1    Kale, S.2    Saripella, P.3    Sehgal, N.4    Gupta, R.5
  • 24
    • 84990479742 scopus 로고
    • An efficient heuristic procedure for partitioning graphs
    • B. W. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs," Bell Systems Technical Journal, vol. 49, no. 1, pp. 291-307, 1970.
    • (1970) Bell Systems Technical Journal , vol.49 , Issue.1 , pp. 291-307
    • Kernighan, B.W.1    Lin, S.2


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