Effective heuristics for timing driven constructive placement

被引:0
|
作者
Raj, RV
Murty, NS
Rao, PSN
Patnaik, LM
机构
来源
TENTH INTERNATIONAL CONFERENCE ON VLSI DESIGN, PROCEEDINGS | 1997年
关键词
D O I
10.1109/ICVD.1997.567958
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we present, a novel approach to path-based timing driven constructive placement based on simple yet effective heuristics. A novel circuit model is proposed. We have extended an existing pad placement technique for sequential circuits. The results for pad placement are compared to the existing work, by using the TimberWolf placement package for cell placement. In cell placement, demonstrated in this paper for combinational circuits, we have innovated on the method of defining the region for locating a cell (window) to minimise the interconnect delay. The window region is determined by the paths in the circuit, and, the cells are chosen from the critical path. The placement approach and ifs experimental results are presented in detail. We also present, the results of a study on the effectiveness of using subsets of the the paths in the circuit, for timing driven placement. We believe that our work is the first one, to comprehensively address the issue of pad placement, and to study the effectiveness of using subsets of the paths in the circuit in timing driven placement. These techniques are being adapted for use in VLSI placement in an industrial environment.
引用
收藏
页码:38 / 43
页数:6
相关论文
共 50 条
  • [1] Timing-driven via placement heuristics for three-dimensional ICs
    Pavlidis, Vasilis F.
    Friedman, Eby G.
    INTEGRATION-THE VLSI JOURNAL, 2008, 41 (04) : 489 - 508
  • [2] An Effective Timing-Driven Detailed Placement Algorithm for FPGAs
    Dhar, Shounak
    Iyer, Mahesh A.
    Adya, Saurabh
    Singhal, Love
    Rubanov, Nikolay
    Pan, David Z.
    ISPD'17: PROCEEDINGS OF THE 2017 ACM INTERNATIONAL SYMPOSIUM ON PHYSICAL DESIGN, 2017, : 151 - 158
  • [3] A FAST AND EFFECTIVE TIMING-DRIVEN PLACEMENT TOOL FOR FPGAs
    Khalid, Mohammed A. S.
    Xu, Yonghong
    JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2008, 17 (04) : 663 - 673
  • [4] TIMING DRIVEN PLACEMENT
    MAREKSADOWSKA, M
    LIN, SP
    1989 IEEE INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN: DIGEST OF TECHNICAL PAPERS, 1989, : 94 - 97
  • [5] Timing driven genetic placement
    Sait, SM
    Youssef, H
    Nassar, K
    Benten, MST
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 1999, 14 (01): : 3 - 14
  • [6] Effective constructive heuristics and meta-heuristics for the distributed assembly permutation flowshop scheduling problem
    Pan, Quan-Ke
    Gao, Liang
    Li Xin-Yu
    Jose, Framinan M.
    APPLIED SOFT COMPUTING, 2019, 81
  • [7] Method of VLSI timing driven placement
    Yan, Xiaolang
    Qi, Xiaoning
    Jin, Ling
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 1993, 21 (02): : 28 - 33
  • [8] Constructive heuristics for technology-driven Resource Constrained Scheduling Problem
    Myszkowski, Pawel B.
    Przewozniczek, Michal
    Skowronski, Marek
    PROCEEDINGS OF THE 2015 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS, 2015, 5 : 119 - 127
  • [9] Efficient timing closure without timing driven placement and routing
    Vujkovic, M
    Wadkins, D
    Swartz, B
    Sechen, C
    41ST DESIGN AUTOMATION CONFERENCE, PROCEEDINGS 2004, 2004, : 268 - 273
  • [10] A Fair Comparison of VM Placement Heuristics and a More Effective Solution
    Li, Xi
    Ventresque, Anthony
    Murphy, John
    Thorburn, James
    2014 IEEE 13TH INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED COMPUTING (ISPDC), 2014, : 35 - 42