1 research outputs found

    A Theoretical Upper Bound for IP-Based Floorplanning

    No full text
    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 slic-ing floorplan F of these modules such that Area(F) ≤ min{1.131,(1 + β)}Atotal, where β =
    corecore