By Topic

AKEBONO: A novel quick incremental placer

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xin Zhang ; Fac. of Sci., Kochi Univ., Kochi, Japan ; Takeuchi, T. ; Toyonaga, M.

In DSM era, the every stages of realistic design flow must interact with physical aspects of the design. For example, improvements in power timing may require replacing many modules with variants that have different shape and connectivity. In this paper, we present AKEBONO - a very quick incremental placement algorithm for performing Engineering Change Order (ECO). AKEBONO consists of two stages: first is an iterative net-driven standard-cell placement with hierarchical partitioning, second is a legalization to fit rows and to remove overlaps. As a radix-like sort algorithm is applied to AKEBONO, the total time complexity of it is O(n). Experimental results on ISPD04 IBM standard cell benchmark suite [3] show that run time of AKBONO is 30times faster than the state state-of-the-art academic placers Capo 10.5 legalizer with Greedy and RowIroning [4] on average. Though Capo 10.5 legalizer generally increases HPWL by 9.4% while our placer produces an increase of 13.8%, however we will claim that AKEBONO provides evener and practical placement results.

Published in:

IC Design and Technology, 2009. ICICDT '09. IEEE International Conference on

Date of Conference:

18-20 May 2009