메뉴 건너뛰기




Volumn 11, Issue 6, 2003, Pages 1120-1135

Fixed-outline floorplanning: Enabling hierarchical design

Author keywords

Floorplanning; Hierarchical design; Physical design; Placement; VLSI CAD

Indexed keywords

ALGORITHMS; APPLICATION SPECIFIC INTEGRATED CIRCUITS; COMPUTER AIDED DESIGN; MICROPROCESSOR CHIPS; PARETO PRINCIPLE; SIMULATED ANNEALING; VLSI CIRCUITS;

EID: 0742321357     PISSN: 10638210     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVLSI.2003.817546     Document Type: Article
Times cited : (334)

References (29)
  • 1
    • 0036377317 scopus 로고    scopus 로고
    • Consistent placement of macro-blocks using floorplanning and standard-cell placement
    • S. N. Adya and I. L. Markov, "Consistent placement of macro-blocks using floorplanning and standard-cell placement," in Proc. ISPD, 2002, pp. 12-17.
    • Proc. ISPD, 2002 , pp. 12-17
    • Adya, S.N.1    Markov, I.L.2
  • 2
    • 0035181641 scopus 로고    scopus 로고
    • Fixed-outline floorplanning through better local search
    • S. N. Adya and I. L. Markov, "Fixed-outline floorplanning through better local search," in Proc. ICCD, 2001, pp. 328-334.
    • Proc. ICCD, 2001 , pp. 328-334
    • Adya, S.N.1    Markov, I.L.2
  • 3
    • 0032651060 scopus 로고    scopus 로고
    • Hypergraph partitioning for VLSI CAD: Methodology for reporting, and new results
    • A. E. Caldwell, A. B. Kahng, A. A. Kennings, and I. L. Markov, "Hypergraph partitioning for VLSI CAD: Methodology for reporting, and new results," in Proc. DAC, 1999, pp. 349-354.
    • Proc. DAC, 1999 , pp. 349-354
    • Caldwell, A.E.1    Kahng, A.B.2    Kennings, A.A.3    Markov, I.L.4
  • 4
    • 0033697586 scopus 로고    scopus 로고
    • Can recursive bisection alone produce routable placements?
    • A. E. Caldwell, A. B. Kahng, and I. Markov, "Can recursive bisection alone produce routable placements?," in Proc. DAC, 2000, pp. 477-482.
    • Proc. DAC, 2000 , pp. 477-482
    • Caldwell, A.E.1    Kahng, A.B.2    Markov, I.3
  • 5
    • 0033701594 scopus 로고    scopus 로고
    • B*-trees: A new representation for nonslicing floorplans
    • Y.C. Chang, Y. W. Chang, G. M. Wu, and S.W. Wu, "B*-trees: A new representation for nonslicing floorplans," in Proc. DAC, 2000, pp. 458-463
    • Proc. DAC, 2000 , pp. 458-463
    • Chang, Y.C.1    Chang, Y.W.2    Wu, G.M.3    Wu, S.W.4
  • 6
    • 0033684694 scopus 로고    scopus 로고
    • Floorplan sizing by linear programming approximation
    • P. Chen and E. S. Kuh, "Floorplan sizing by linear programming approximation," in Proc. DAC, 2000, pp. 468-471.
    • Proc. DAC, 2000 , pp. 468-471
    • Chen, P.1    Kuh, E.S.2
  • 7
    • 0033338004 scopus 로고    scopus 로고
    • Buffer block planning for interconnect-driven floorplanning
    • J. Cong, T. Kong, and D. Z. Pan, "Buffer block planning for interconnect-driven floorplanning," in Proc. ICCAD, 1999, pp. 358-363.
    • Proc. ICCAD, 1999 , pp. 358-363
    • Cong, J.1    Kong, T.2    Pan, D.Z.3
  • 8
    • 0742275741 scopus 로고    scopus 로고
    • Silicon virtual prototyping: The new cockpit for nanometer chip design
    • W. Dai, D. Huang, C. Chang, and M. Courtoy, "Silicon virtual prototyping: The new cockpit for nanometer chip design," in Proc. ASP-DAC, 2003, pp. 635-369.
    • Proc. ASP-DAC, 2003 , pp. 635-639
    • Dai, W.1    Huang, D.2    Chang, C.3    Courtoy, M.4
  • 10
    • 0032669169 scopus 로고    scopus 로고
    • Arbitrary convex and concave rectilinear block packing using sequence pair
    • K. Fujuyoshi and H. Murata, "Arbitrary convex and concave rectilinear block packing using sequence pair," in Proc. ISPD 1999, pp. 103-110.
    • Proc. ISPD 1999 , pp. 103-110
    • Fujuyoshi, K.1    Murata, H.2
  • 11
    • 0034481271 scopus 로고    scopus 로고
    • Corner block list: An effective and efficient topological representation of nonslicing floorplan
    • X. Hong, et al., "Corner block list: An effective and efficient topological representation of nonslicing floorplan," in Proc. ICCAD 2000, pp. 8-13.
    • Proc. ICCAD 2000 , pp. 8-13
    • Hong, X.1
  • 13
    • 0033705078 scopus 로고    scopus 로고
    • Classical floorplanning harmful?
    • A. B. Kahng, "Classical floorplanning harmful?," in Proc. ISPD 2000, pp. 207-213.
    • Proc. ISPD 2000 , pp. 207-213
    • Kahng, A.B.1
  • 16
    • 33645193378 scopus 로고    scopus 로고
    • Design flow and methodology for 50M gate ASIC
    • A. Mehotra, L. V. Ginneken, and Y. Trivedi, "Design flow and methodology for 50M gate ASIC," in ASP-DAC 2003, pp. 640-647.
    • ASP-DAC 2003 , pp. 640-647
    • Mehotra, A.1    Ginneken, L.V.2    Trivedi, Y.3
  • 17
    • 0034855935 scopus 로고    scopus 로고
    • TCG: A transitive closure graph based representation for nonslicing floorplans
    • J. Lin and Y. Chang, "TCG: A Transitive Closure Graph based representation for nonslicing floorplans," in Proc. DAC 2001, pp. 764-769.
    • Proc. DAC 2001 , pp. 764-769
    • Lin, J.1    Chang, Y.2
  • 19
    • 0030245072 scopus 로고    scopus 로고
    • Globally optimal floorplanning for a layout problem
    • Sept.
    • T.S. Moh, T.S. Chang, and S.L. Hakimi, "Globally optimal floorplanning for a layout problem," IEEE Trans. Circuits Syst. I, vol. 43, pp. 713-720, Sept. 1996.
    • (1996) IEEE Trans. Circuits Syst. I , vol.43 , pp. 713-720
    • Moh, T.S.1    Chang, T.S.2    Hakimi, S.L.3
  • 20
    • 0030378255 scopus 로고    scopus 로고
    • VLSI module placement based on rectangle-packing by the sequence pair
    • H. Murata, K. Fujiyoshi, S. Nakatake, and Y. Kajitani, "VLSI module placement based on rectangle-packing by the sequence pair," in Proc. IEEE Trans. CAD, vol. 15, pp. 1518-1524.
    • (1996) Proc. IEEE Trans. CAD , vol.15 , pp. 1518-1524
    • Murata, H.1    Fujiyoshi, K.2    Nakatake, S.3    Kajitani, Y.4
  • 21
    • 0031651588 scopus 로고    scopus 로고
    • Sequence-pair based placement methods for hard/soft-pre-placed modules
    • H. Murata and E. S. Kuh, "Sequence-pair based placement methods for hard/soft-pre-placed modules," in Proc. ISPD 1998, pp. 167-172.
    • Proc. ISPD 1998 , pp. 167-172
    • Murata, H.1    Kuh, E.S.2
  • 22
    • 0006685403 scopus 로고    scopus 로고
    • Post-placement residual-overlap removal with minimal movement
    • S. Nag and K. Chaudhary, "Post-placement residual-overlap removal with minimal movement," DATE '99, pp. 581-586.
    • DATE '99 , pp. 581-586
    • Nag, S.1    Chaudhary, K.2
  • 23
    • 0033704928 scopus 로고    scopus 로고
    • An enhanced perturbing algorithm for floorplan design using the O-tree representation
    • Y. Pang, C. K. Cheng, and T. Yoshimura, "An enhanced perturbing algorithm for floorplan design using the O-tree representation," in Proc. ISPD 2000, pp. 168-173.
    • Proc. ISPD 2000 , pp. 168-173
    • Pang, Y.1    Cheng, C.K.2    Yoshimura, T.3
  • 24
    • 0033682587 scopus 로고    scopus 로고
    • Block placement with symmetry constraint based on the O-tree nonslicing representation
    • Y. Pang, F. Balasa, K. Lampaert, and C. K. Chang, "Block placement with symmetry constraint based on the O-tree nonslicing representation," in Proc. DAC 2000, pp. 464-468.
    • Proc. DAC 2000 , pp. 464-468
    • Pang, Y.1    Balasa, F.2    Lampaert, K.3    Chang, C.K.4
  • 25
    • 0742293170 scopus 로고    scopus 로고
    • Monterey usage at STMicroelectronics
    • F. Remond, "Monterey usage at STMicroelectronics," DAC 02.
    • DAC 02
    • Remond, F.1
  • 27
    • 0002701738 scopus 로고    scopus 로고
    • Fast evaluation of sequence pair in block placement by longest common subsequence computation
    • X. Tang, R. Tian, and D. F. Wong, "Fast evaluation of sequence pair in block placement by longest common subsequence computation," in Proc. DATE 2000, pp. 106-111.
    • Proc. DATE 2000 , pp. 106-111
    • Tang, X.1    Tian, R.2    Wong, D.F.3
  • 28
    • 84949784966 scopus 로고    scopus 로고
    • FAST-SP: A fast algorithm for block placement based on sequence pair
    • X. Tang and D. F. Wong, "FAST-SP: A fast algorithm for block placement based on sequence pair," in Proc. ASPDAC 2001.
    • Proc. ASPDAC 2001
    • Tang, X.1    Wong, D.F.2
  • 29
    • 0033691295 scopus 로고    scopus 로고
    • Floorplan area minimization using lagrangian relaxation
    • F. Y. Young, C. C. Chu, W. S. Luk, and Y. C. Wong, "Floorplan area minimization using Lagrangian relaxation," in Proc. ISPD 2000, pp. 174-179.
    • Proc. ISPD 2000 , pp. 174-179
    • Young, F.Y.1    Chu, C.C.2    Luk, W.S.3    Wong, Y.C.4


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