On accelerating slicing floorplan design with boundary constraints

Abstract

Recently Young and Wong extended the well-known simulated annealing based Wong-Liu algorithm [1986] to solve the problem of slicing floorplan design with boundary constraints. The main idea behind the Young-Wong algorithm [1999] is to determine the boundary information of each module in a floorplan by traversing the corresponding normalized Polish expression from right to left once. By carefully examining each of the three types of moves adopted by the Young-Wong algorithm for generating a new normalized Polish expression, we observe that it is very likely that only a subset of modules might have the boundary information changed in the new normalized Polish expression, and hence only the boundary information for those modules needs to be recomputed. Based on the observation, we improve the Young-Wong algorithm by providing methods to accelerate the boundary information computation.