A Theoretical Upper Bound for IP-Based Floorplanning

摘要：

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.

作者: Guowu Yang Xiaoyu Song Hannah H. Yang Fei Xie

作者单位: Dept. of ECE, Portland State University, Oregon, USA CAD Strategic Research Lab, Intel Corporation, Oregon, USA Dept. Computer Science, Portland State University, Oregon, USA

会议类型: 国际会议

会议名称: The 11th Annual International Computing and Combinatorics Conference COCOON 2005(第11届国际计算和组合会议)

会议地点: 昆明

会议语种:英文

页码: 411-419

在线出版日期: 2005-08-01（万方平台首次上网日期，不代表论文的发表时间）