Bus-Driven Floorplanning

  • Authors:
  • Hua Xiang;Xiaoping Tang;Martin D. F. Wong

  • Affiliations:
  • UIUC, Urbana, IL;Cadence Design Systems, San Jose, CA;UIUC, Urbana, IL

  • Venue:
  • Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present an integrated approach to floorplanningand bus planning, i.e., bus-driven floorplanning (BDF). We are givena set of circuit blocks and the bus specifications (i.e., the net list ofblocks for the buses). A feasible BDF solution is a placement ofall circuit blocks such that each bus can be realized as a rectangularstrip (horizontal or vertical) going through all the blocks connectedby the bus. The objective is to determine a feasible BDF solutionthat minimizes floorplan area and total bus area. Our approachis based upon the sequence-pair floorplan representation. After acareful analysis of the relationship between bus ordering and blockordering in the floorplan represented by a sequence pair, we derivefeasibility conditions on sequence pairs that give feasible BDFsolutions. Experimental results demonstrate the efficiency and effectivenessof our algorithm.