Abstract: In order to improve the global effect of placement, we introduce an efficient and fast algorithm. The main idea of this algorithm is that the entire placement area is hierarchically decomposed into blocks. At each level of the decomposition, the cells in the block exchange at the same time when they can minimize cost function. Several questions about the algorithm are discussed. The time complxity is proved to be O（n）.