Based Global Routing - VLSI Physical Design Automation - Home Work, Exercises of Computer Science

Download Based Global Routing - VLSI Physical Design Automation - Home Work and more Exercises Computer Science in PDF only on Docsity! VLSI Physical Design Automation 1. ILP based global routing: Formulate an ILP-based routing problem for the following netlist: {n1=B2−B4−B6, n2=B3−B4, n3=B1−B2−B5−B6, n4=B2−B5}. Assume that the capacity of each boundary is as follows: {B1−B2: 3, B2−B3: 4, B4−B5: 5, B5−B6: 4, B1−B4: 7, B2−B5: 5, B3−B6: 3}. 2. Maze & line search algorithm: For each given algorithm that finds a path from s to t on the following grid, (i) fill in the visited cells with proper labels, (ii) give the total number of cells visited, and (iii) give the length of the path found. a) Lee’s maze router with double fan-out b) Lee’s maze router with Akers’ 1122 sequence c) Hadlock’s minimum detour router d) How many lines and exit points will Mikami-Tabuchi and Hightower algorithm generate? B1 B2 B3 B4 B5 B6 s t Docsity.com