A theoretical upper bound for IP-based floorplanning

Abstract

Floorplan is a crucial estimation task in the modern layout design of systems on chips. The paper presents a novel theoretical upper bound for slicing floorplans with soft modules. We show that, given a set of soft modules of total area Atotal, maximum area Amax, and shape flexibility r ≥ 2.25, there exists a slicing floorplan F of these modules such that Area(F) ≤ min{1.131, (1 + β)}Atotal, where β= √Amax/2rAtotal. Our results ameliorate the existing best results. © Springer-Verlag Berlin Heidelberg 2005.