An enhanced perturbing algorithm for floorplan design using the O-tree representation

Recently, a deterministic algorithm based on the O-tree representation has been proposed. This method generates excellent layout results on MCNC test cases with O(n3 ) complexity, where n is the number of blocks. In this paper, we reduce the complexity of the deterministic algorithm to O(n2 ). Experimental results indicate our algorithm maintains the high quality of the deterministic algorithm at a fraction of the CPU time.

• Type: Conference
• Year: 2000
• Where: ISPD
• Authors: Yingxin Pang, Chung-Kuan Cheng, Takeshi Yoshimura
• Keywords: Deterministic Algorithm, Hardware, ISPD 2000, MCNC Test Cases, O-tree Representation