NYCU 2023 Spring "The Applications of Algorithms on Routing Problems" Lab Submission
Implement a greedy channel router proposed in this paper.
Implement the global router that can complete ISPD 2008 Global Routing Contest, and try to minimize the total overflow (TOF), max overflow (MOF), wirelength (WL) and runtime.
Congestion map (top: horizontal, bottom: vertical):
| adaptec1 | adaptec2 | adaptec3 | adaptec4 | adaptec5 |
|---|---|---|---|---|
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
All testcases satisfies the requirements in spec!
Implement a grid-based 2-pin net router based on the routing part mentioned in this paper. It is required to use MaxSAT/ILP solver such as Open-WBO MaxSAT Solver or glpsol.
| case1.txt | case2.txt | case3.txt | case4.txt | case5.txt |
|---|---|---|---|---|
 |
 |
 |
 |
 |