ePlace-3D: Electrostatics based Placement for 3D-ICs

Authors: Jingwei Lu, Hao Zhuang, Ilgweon Kang and Chung-Kuan Cheng
Affiliation: Department of Computer Science and Engineering, University of California, San Diego, USA
Contact: francesco DOT ljw AT gmail DOT com

[Animation]           [Publication]           [Overview]           [Results]           [Download]           [License]


Animation

3D electrostatic field animation of density-only placement
progression on MMS ADAPTEC1 with 221K nets, 63
movable macros and 210K movable standard cells.
3D cell layout animation of wirelength & density-driven
placement progression on MMS ADAPTEC1 with 221K
nets, 63 movable macros and 210K movable standard cells.


Related Publications

  • J. Lu, H. Zhuang, I. Kang, P. Chen C.-K. Cheng, "ePlace-3D: Electrostatics based Placement for 3D-ICs", ISPD 2016, pages 11-18. (pdf).
  • J. Lu, H. Zhuang, P. Chen, H. Chang, C.-C. Chang, Y.-C. Wong, L. Sha, D. J.-H. Huang, Y. Luo, C.-C. Teng and C.-K. Cheng, "ePlace-MS: Electrostatics based Placement for Mixed-Size Circuits", IEEE TCAD 34(5) (2015), pp. 685-698. (pdf).
  • J. Lu, P. Chen, C.-C. Chang, L. Sha, D. J.-H. Huang, C.-C. Teng and C.-K. Cheng, "ePlace: Electrostatics based Placement using Fast Fourier Transform and Nesterov's Method", ACM TODAES 20(2) (2015), article 17. (pdf).
  • J. Lu, P. Chen, C.-C. Chang, L. Sha, D. J.-H. Huang, C.-C. Teng and C.-K. Cheng, "ePlace: Electrostatics Based Placement Using Nesterov's Method", DAC 2014, pages 1-6. (pdf).
  • J. Lu, P. Chen, C.-C. Chang, L. Sha, D. J.-H. Huang, C.-C. Teng and C.-K. Cheng, "FFTPL: An Analytic Placement Algorithm Using Fast Fourier Transform for Density Equalization", ASICON 2013, pages 1-4. (pdf).


  • Overview

  • develop a novel density function eDensity based on the analogy between placement and electrostatic system
  • propose a modified Poisson's equation with Neumann boundary condition to enforce placement legality
  • propose a fast numerical solution to the Poisson's equation using spectral methods, which well satisfies the boundary condition
  • use Nesterov's method to solve the nonlinear placement problem with runtime step length prediction to resolve runtime bottleneck
  • The entire flow of ePlace-3D.
    Average HPWL and number of VIs of eight selected
    MMS cases w.r.t. number of silicon tiers.
    Average HPWL and number of VIs of all the 16 MMS
    cases w.r.t. the weight of VIs.


    Experiments and Results

    We implement ePlace-3D using C programming language. Our program together with other placers are all executed in single-thread mode on a Linux machine with Intel i7 920 2.67GHz CPU and 12GB memory. Experiments are conducted on IBM-PLACE for standard-cell placement, as well as MMS benchmarks for modern mixed-size placement. Solution quality is evaluated by respective official scripts.

    For your convenience please find all the benchmark suites (IBM-PLACE and MMS).

    We include two previous 3D-IC placement algorithms for experiments and performance comparison, namely, NTUplace3-3D, mPL6-3D.

    For detailed experimental results, please refer to Table 1 and Table 2 of our paper.


    Application for software

    Please fill out the following agreement form. We will email you the placement software upon receiving your submission of agreement.

    First name:

    Last name:

    Email:

    Affiliation:

    Purpose of usage:

    I agree with the following license terms.


    License terms

    READ THIS LICENSE AGREEMENT CAREFULLY BEFORE USING THIS PRODUCT. BY USING THIS PRODUCT YOU INDICATE YOUR ACCEPTANCE OF THE TERMS OF THE FOLLOWING AGREEMENT. THESE TERMS APPLY TO YOU AND ANY SUBSEQUENT LICENSEE OF THIS PRODUCT.

    License Agreement for ePlace-3D

    Copyright (c) 2014 by Jingwei Lu and Chung-Kuan Cheng ("Authors")
    http://vlsi-cuda.ucsd.edu/~ljw/ePlace-3D/ ("URL")
    All rights reserved

    Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:

  • Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
  • Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
  • Neither the names nor any trademark of the Authors may be used to endorse or promote products derived from this software without specific prior written permission.
  • Use is limited to academic research groups only. Users who are interested in industry or commercial purposes must notify Authors and request separate license agreement.
  • Redistributions of the Code in executable form, or a program dependent upon the Code, must show at launch a prominent display (e.g., splash screen or banner text) of the copyright information, including Authors' attribution, shown above.


  • THIS FREE SOFTWARE IS PROVIDED BY THE AUTHOR "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR ANY CONTRIBUTOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, EFFECTS OF UNAUTHORIZED OR MALICIOUS NETWORK ACCESS; PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.