VLSI Floorplanning with Boundary Constraints Based on CornerVLSI布图规划基于角点边界约束.pptVIP

Solution Space Smoothing Method and its Application Outline Principle of Search Space Smoothing VLSI Placement based on SSS Local Smoothing Global Smoothing VLSI Placement based on P-SSS Experimental Results Applications: TSP, Temporal planning, FPGA Floorplanning NP-hard Problem and Optimization Algorithm A NP-Hard Problem has a complicated search space, a greedy search strategy gets stuck at one of the deep canyons easily, unable to climb out and to reach the global energy minimum. To avoid getting stuck at one local minimum, there are commonly two types of approaches. 1). To introduce complex moves, 2). To introduce some mechanisms to allow the search to climb over the energy barrier. (ie. The simulated annealing algorithm) History of Search Space Smoothing (SSS) Jun Gu and Xiaofei Huang proposed a 3rd approach, that is, to smooth the solution space. They had applied this method to the classical NP-hard problem: TSP. Using the smoothing function below. Principle of Search Space Smoothing By Search Space Smoothing ,The rugged terrain of search space of a NP-hard problem is smoothed, and therefore the original problem instance is transformed into a series of gradually simplified problem instances. The solutions of the simplified instances are used to guide the search of more complicated ones. Finally, the original problem is solved in the end of the series. Principle of Search space smoothing Formal Description of SSS Algorithm //Initialization α ← α0; x ← x0; //Search while (α = 0) do begin H(α) ← DoSmooth(α, H); for (some times) do begin x’ ← NeighborhoodTransition(x); if (Acceptable(α, x, x’)) then begin x ← x’; end; end; α ← NewAlpha(α); end; End; History of Search Space Smoothing (SSS) Johannes Schneider investigates this method for traveling salesman problem thoroughly and pointed out that “the advantage(of search space smoothing) over the later one(simulated annealing: SA) is that a certain amount of computational effort