메뉴 건너뛰기




Volumn , Issue , 2004, Pages 282-287

Practical slicing and non-slicing block-packing without simulated annealing

Author keywords

Block packing; Branch and bound; Evaluation; Floorplanning; Hierarchical; Large scale; Optimal; Slicing; Soft blocks

Indexed keywords

ALGORITHMS; BENCHMARKING; OPTIMIZATION; PROBLEM SOLVING; SIMULATED ANNEALING; TREES (MATHEMATICS); VECTORS;

EID: 2942692522     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/988952.989020     Document Type: Conference Paper
Times cited : (31)

References (20)
  • 1
    • 0742321357 scopus 로고    scopus 로고
    • Fixed-outline floorplanning: Enabling hierarchical design
    • S.N. Adya, I.L. Markov, "Fixed-outline Floorplanning: Enabling Hierarchical Design," IEEE Trans. on VLSI 11(6), pp. 1120-1135, 2003. http://vlsicad.eecs.umich.edu/BK/parquet/
    • (2003) IEEE Trans. on VLSI , vol.11 , Issue.6 , pp. 1120-1135
    • Adya, S.N.1    Markov, I.L.2
  • 2
    • 0034313430 scopus 로고    scopus 로고
    • Optimal partitioners and end-case placers for standard-cell layout
    • A.E. Caldwell, A.B. Kahng, and I.L. Markov, "Optimal Partitioners and End-case Placers for Standard-cell Layout," IEEE Trans. on CAD, 19(11), pp. 1304-1314, 2000.
    • (2000) IEEE Trans. on CAD , vol.19 , Issue.11 , pp. 1304-1314
    • Caldwell, A.E.1    Kahng, A.B.2    Markov, I.L.3
  • 4
    • 0033701594 scopus 로고    scopus 로고
    • B*-trees: A new representation for non-slicing floorplans
    • Y.-C. Chang et al., "B*-trees: A New Representation for Non-Slicing Floorplans," DAC2000, pp. 458-463.
    • DAC2000 , pp. 458-463
    • Chang, Y.-C.1
  • 6
    • 0032690067 scopus 로고    scopus 로고
    • An O-tree representation of non-slicing floorplan and its applications
    • P.-N. Quo, C.-K. Cheng, T. Yoshimura, "An O-tree Representation of Non-Slicing Floorplan and Its Applications," DAC1999, pp. 268-273.
    • DAC1999 , pp. 268-273
    • Quo, P.-N.1    Cheng, C.-K.2    Yoshimura, T.3
  • 7
    • 0034481271 scopus 로고    scopus 로고
    • Corner block list: An effective and efficient topological representation of non-slicing floorplan
    • X. Hong et al., "Corner Block List: An Effective and Efficient Topological Representation of Non-Slicing Floorplan," ICCAD 2000, pp. 8-12.
    • ICCAD 2000 , pp. 8-12
    • Hong, X.1
  • 8
    • 2942519339 scopus 로고    scopus 로고
    • Slicing tree is a complete floorplan representation
    • M. Lai and D. Wong, "Slicing Tree Is a Complete Floorplan Representation," DATE 2001, pp. 228-232.
    • DATE 2001 , pp. 228-232
    • Lai, M.1    Wong, D.2
  • 9
    • 0041633620 scopus 로고    scopus 로고
    • Multilevel floorplanning/placement for large-scale modules using B*-trees
    • H.-C Lee, Y.-W Chang, J.-M Hsu, and H.H. Yang, "Multilevel Floorplanning/Placement for Large-Scale Modules Using B*-Trees," DAC 2003, pp. 812-817.
    • DAC 2003 , pp. 812-817
    • Lee, H.-C.1    Chang, Y.-W.2    Hsu, J.-M.3    Yang, H.H.4
  • 10
    • 0036051250 scopus 로고    scopus 로고
    • TCG-S: Orthogonal coupling of P*-admissible representations for general floorplans
    • J.-M. Lin and Y.-W. Chang, "TCG-S: Orthogonal Coupling of P*-admissible Representations for General Floorplans," DAC 2002, pp. 842-847.
    • DAC 2002 , pp. 842-847
    • Lin, J.-M.1    Chang, Y.-W.2
  • 11
    • 2942682814 scopus 로고    scopus 로고
    • Multi-project reticle floorplanning and wafer dicing
    • to appear
    • I. Mandoiu, "Multi-Project Reticle Floorplanning and Wafer Dicing," to appear in ISPD 2004.
    • ISPD 2004
    • Mandoiu, I.1
  • 12
    • 0030378255 scopus 로고    scopus 로고
    • VLSI module placement based on rectangle-packing by the sequence-pair
    • H. Murata et al., "VLSI Module Placement Based on Rectangle-Packing by the Sequence-Pair," IEEE Trans on CAD 15(12), pp. 1518-1524, 1996.
    • (1996) IEEE Trans on CAD , vol.15 , Issue.12 , pp. 1518-1524
    • Murata, H.1
  • 13
    • 0030408582 scopus 로고    scopus 로고
    • Module placement on BSG-structure and IC layout applications
    • S. Nakatake et al., "Module Placement on BSG-structure and IC Layout Applications," ICCAD 1996, pp. 484-491.
    • ICCAD 1996 , pp. 484-491
    • Nakatake, S.1
  • 14
    • 0026175734 scopus 로고    scopus 로고
    • Branch-and-bound placement for building block layout
    • H. Onodera, Y. Taniguchi, and K. Tamaru, "Branch-and-Bound Placement for Building Block Layout," DAC 1991, pp. 433-439.
    • DAC 1991 , pp. 433-439
    • Onodera, H.1    Taniguchi, Y.2    Tamaru, K.3
  • 15
    • 85040657895 scopus 로고    scopus 로고
    • A new algorithm for floorplan design
    • D. F. Wong and C. L. Liu, "A New Algorithm for Floorplan Design," DAC 1986, pp. 101-107.
    • DAC 1986 , pp. 101-107
    • Wong, D.F.1    Liu, C.L.2
  • 16
    • 0030685651 scopus 로고    scopus 로고
    • Cluster refinement for block placement
    • J. Xu, P.-N. Guo, and C.-K. Cheng, "Cluster Refinement for Block Placement," DAC 1997, pp. 762-765.
    • DAC 1997 , pp. 762-765
    • Xu, J.1    Guo, P.-N.2    Cheng, C.-K.3
  • 17
    • 0037218783 scopus 로고    scopus 로고
    • Floorplan representations: Complexity and connections
    • B. Yao et al., "Floorplan Representations: Complexity and Connections," ACM Trans. on Design Autom. of Electronic Systems 8(1), pp. 55-80, 2003.
    • (2003) ACM Trans. on Design Autom. of Electronic Systems , vol.8 , Issue.1 , pp. 55-80
    • Yao, B.1
  • 18
    • 84862367847 scopus 로고    scopus 로고
    • http://cc.ee.ncu.edu.tw/~ywchang/research.html
  • 19
    • 84862367972 scopus 로고    scopus 로고
    • http://vlsicad.eecs.umich.edu/BK/BloBB/
  • 20
    • 84862371297 scopus 로고    scopus 로고
    • http://vlsicad.eecs.umich.edu/BK/CornpaSS/


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