Continuing the tradition of spirited competition, the ISPD 2007 Steering Committee is pleased to announce a global routing contest, sponsored by SRC and IEEE-CEDA. Like the prior placement contests, a set of benchmarks will be released; teams are invited to produce global routing solutions, with the best results winning fame, recognition, and a grand prize. There will be an additional prize awarded by the IEEE Council of EDA (CEDA) for the best results on the multi-layer examples by a router openly available to all research groups. If the best results overall are obtained by an openly available router, it will win both the prizes.
The global routing solutions will be evaluated on the following metrics:
Minimum total overflow for all benchmarks. Each benchmark will have a number of edges between global routing tiles; each of these edges will have a capacity. All nets must be routed within the global routing graph, ideally with no graph edge exceeding the specified capacity.
There will be two sets of benchmarks.
The first set of benchmarks will consist of a planar routing graph, using the Labyrinth format. This format should make it possible for many academic tools to participate in the contest, and writing a global router which uses the format is not exceptionally difficult. The output file format will be the BoxRouter format.
There will be separate prizes for each set of benchmarks (and it is entirely possible that one global router could win both groups).
REGISTRATION: If you are interested in participating in
the contest, please send email to Dr. Gi-Joon
January 8th: Announcement of the Contest
January 12th: Training benchmarks released.
January 28th: Last day to
confirm participation with Dr.
February 12th: Contest benchmarks released.
March 11th: Final day to submit binary for the global router, and routing results.
FILE FORMAT for Three Dimensional Benchmarks
The file format for the global routing contest is illustrated, with comments in italics (these will not be in actual input files). This example illustrates a problem with five routing layers (note the number of # marks on the vertical and horizontal capacity lines).
grid # # # (x grids, y grids,
number of layers)
vertical capacity # # # # # (vertical capacity by default on each layer)
horizontal capacity # # # # #
minimum width # # # # #
minimum spacing # # # # #
via spacing # # # # #
lower_left_x lower_left_y tile_width tile_height
num net #
netname id_# number_of_pins minimum_width
x y layer
x y layer
[repeat for the appropriate number of nets]
# capacity adjustments (to model
column row layer column row layer reduced_capacity_level
[repeat for the number of capacity adjustments]
There are a number of changes from the Labyrinth format:
Calculation of capacity is more complex than is done in typical academic global routing tools; our objective is to raise the bar slightly. Each global routing tile will have a capacity; this is a measure of the available space, not the number of global routing tracks. If the minimum wire width is 20, the minimum spacing 10, and the capacity of a tile is given as 450, this corresponds to 15 minimum width tracks (15 * (20 + 10)) . The capacity specified as the default value may be different than the width or height of a tile: in general, it is desirable to have routing utilization of a tile be below 70% of capacity, as higher values are difficult for detail routers to complete.
A simple 2-d routing problem, with illustrations. Input. Output. Description.
A simple 3-d routing problem, with illustrations. Input. Output. Description.
|Team Name||Contact||Email Address||Other Authors|
|UCLA FlexRouter||Lei He (U of California, Los Angeles)||email@example.com||Tom Tong Jing (firstname.lastname@example.org), Zhen Cao, Paul Mesa, Yiyu Shi, Yu Hu|
|Team 3||Pei-Ci Wu (National Tsing-Hua University, Taiwan)||email@example.com||Kuang-Yao Lee, Jhih-Rong Gao, Tsung-Hsien Lee, Yen-Jung Chang, Ting-Chi Wang|
Guojie Luo (U of
||firstname.lastname@example.org||Yan Zhang (email@example.com), Jason Cong (firstname.lastname@example.org)|
|Instant Karma||Patrick Madden (SUNY, Binghamton)||email@example.com|
|Box Router||David Pan (U of Texas, Austin)||firstname.lastname@example.org||Minsik Cho (email@example.com)|
|Team 8||Chris Chu (Iowa State University)||firstname.lastname@example.org||Yanheng Zhang (email@example.com)|
|Team 9||Huang-Yu Chen (National Taiwan University, Taiwan)||firstname.lastname@example.org||Chin-Hsiung Hsu (email@example.com), Chung-Wei Lin (firstname.lastname@example.org), Yao-Wen Chang (email@example.com)|
|Team 10||Yih-Lang Li(National Chiao-Tung University, Taiwan)||firstname.lastname@example.org||Jyun-Yi Lin (email@example.com), Ken-Ren Dai (firstname.lastname@example.org), Yih-Lang Li (email@example.com)|
|FGR||Jarrod Roy (U of Michigan)||firstname.lastname@example.org||Igor Markov (email@example.com)|
|Team 13||Tai-Chen Chen (National Taiwan University, Taiwan)||firstname.lastname@example.org||Kai-Chi Hsu (email@example.com), Shi-Lun Huang (firstname.lastname@example.org), Meng-Ziang Li (email@example.com), Yao-Wen Chang (firstname.lastname@example.org)|
|Team 14||Hung-Ming Chen (National Chiao-Tung University, Taiwan)||email@example.com|
|MaizeRouter||Michael D. Moffitt (U of Michigan)||firstname.lastname@example.org|
|Team 16||Soheil Modirzadeh (Cadence Design Systems)||email@example.com||Nora Chu (firstname.lastname@example.org)|
|Bockenem(Stau auf der A7)||Artur Quiring (Cadence Berkely Lab)||email@example.com||Philip Chong (firstname.lastname@example.org), Christoph Albrecht (email@example.com)|
Openly Available Tools
What does "openly available for research" mean? In this case, the intent is to foster an academic infrastructure where all the necessary pieces are easily available to those who wish to do research on EDA algorithms and flows. So by openly available we mean (a) the source code is freely available, along with make files and some examples with known results, all capable of running on a stock Linux system, and (b) the licensing terms, if any, are appropriate for research.
Note that (b) applies not only to the global router itself, but any code it requires. For example, if your global router needs a SAT solver from another group, the SAT solver must in turn be easily available for research for your entry to qualify. IEEE/CEDA will test (a) and be the final judge of (b) before awarding the prize.