CUGR is a VLSI global routing tool developed by the research team supervised by Prof. Evangeline F. Y. Young at The Chinese University of Hong Kong (CUHK). Different from previous global routers whose quality is usually measured by wirelength and resource overflow, CUGR is a detailed routability-driven global router and its solution quality is solely determined by the final detailed routing results. In particular, our global router adopts several efficient and effective methods to generate a set of connected rectangles to guide the detailed router:
- A sophisticated probability-based cost scheme
- An optimal 3D pattern routing technique that combines 2D pattern routing and layer assignment
- A multi-level maze routing utilizes two levels of routing
- A patching technique that adds useful route guides to further improve the detailed routability.
More details are in the following paper:
- Jinwei Liu, Chak-Wa Pui, Fangzhou Wang, Evangeline F. Y. Young, "CUGR: Detailed-Routability-Driven 3D Global Routing with Probabilistic Resource Model", ACM/IEEE Design Automation Conference (DAC), San Francisco, CA, USA, July 19-23, 2020.
1. How to Build
Step 1: Download the source code. For example,
$ git clone https://github.com/cuhk-eda/cu-gr
Step 2: Go to the project root and build by
$ cd cu-gr $ scripts/build.py -o release
Note that this will generate two folders under the root,
build contains intermediate files for build/compilation, while
run contains binaries and auxiliary files).
More details are in
- GCC (version >= 5.5.0) or other working c++ compliers
- CMake (version >= 2.8)
- Boost (version >= 1.58)
- Python (version 3, optional, for utility scripts)
- Innovus® (version 18.1, optional, for design rule checking and evaluation)
- Rsyn (a trimmed version is used, already added under folder
- Dr. CU (v4.1.1, optional, official detailed router for ICCAD'19 Contest, binary is already included under the root)
2. How to Run
2.1. Toy Test
Run Binary Directly
Go to the
run directory and run the binary
iccad19gr with a toy case
$ cd run $ ./iccad19gr -lef ../toys/iccad2019c/ispd18_sample/ispd18_sample.input.lef -def ../toys/iccad2019c/ispd18_sample/ispd18_sample.input.def -output ispd18_sample.solution.guide -threads 8
Run with a Wrapping Script
Instead of running the binary directly, you may also use a wrapping script
run.py to save typing and do more:
$ cd run $ ./run.py 8s -p ../toys/
If Innovus® has been properly installed in your OS, an evaluation can be launched by
$ ./run.py 8s -s eval -p ../toys/
In the end, a result table will be printed in the terminal.
Furthermore, the solution can be visualized by
$ ./run.py 8s -s view -p ../toys/
The three steps,
run.py can also be invoked in a single line:
$ ./run.py 8s -s route eval view -p ../toys/
More usage about
run.py can be known by the option
2.2. Batch Test
The benchmarks can be downloaded from the hompage of ISPD'18 Contest .
You may let
run.py know the benchmark path by setting OS environmental variable
BENCHMARK_PATH or specifying it under option
$ cd run $ ./run.py <benchmark_name...|all> -s route eval [option...]
ispd18eval: scripts and other files for evaluation, provided by ICCAD'19 Contest
ispd19eval: scripts and other files for evaluation, provided by ICCAD'19 Contest
rsyn: code from Rsyn for file IO
scripts: utility python scripts
src: C++ source code
db: database, including the global grid graph and the net information
single_net: routing a single net, including querying the global grid graph, building the local grid graph, running maze routing, and some post processing
multi_net: routing all nets with "rip-up and rereoute" and multithreading
utils: some utility code
toys: toy test cases
drcu: default detailed router for evaluation
Experiments are performed on a 64-bit Linux workstation with Intel Xeon Silver 4114 CPU (2.20GHz, 40 cores) and 256GB memory. Consistent with the contest, eight threads are used.
|Design||Wire Length & Via||Non-Preferred Usage||Short||Min-Area & Spacing||DR Score||GR Runtime (sec)|
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 CUGR
Copyright (c) 2020 by The Chinese University of Hong Kong
All rights reserved
CU-SD LICENSE (adapted from the original BSD license) Redistribution of the any code, with or without modification, are permitted provided that the conditions below 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 name nor trademark of the copyright holder or the author may be used to endorse or promote products derived from this software without specific prior written permission.
Users are entirely responsible, to the exclusion of the author, for compliance with (a) regulations set by owners or administrators of employed equipment, (b) licensing terms of any other software, and (c) local, national, and international regulations regarding use, including those regarding import, export, and use of encryption software.
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.