Bus-Driven Floorplanning

Hua Xiang; Xiaoping Tang; Martin D. F. Wong

doi:10.1109/ICCAD.2003.159672

Bus-Driven Floorplanning

Hua Xiang, Xiaoping Tang, Martin D. F. Wong

Office of the Provost

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

Abstract

In this paper, we present an integrated approach to floorplanning and bus planning, i.e., bus-driven floorplanning (BDF). We are given a set of circuit blocks and the bus specifications (i.e., the net list of blocks for the buses). A feasible BDF solution is a placement of all circuit blocks such that each bus can be realized as a rectangular strip (horizontal or vertical) going through all the blocks connected by the bus. The objective is to determine a feasible BDF solution that minimizes floorplan area and total bus area. Our approach is based upon the sequence-pair floorplan representation. After a careful analysis of the relationship between bus ordering and block ordering in the floorplan represented by a sequence pair, we derive feasibility conditions on sequence pairs that give feasible BDF solutions. Experimental results demonstrate the efficiency and effectiveness of our algorithm.

Original language	English
Title of host publication	Proceedings of The IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2003
Place of Publication	United States
Publisher	IEEE
Pages	66-73
Number of pages	8
ISBN (Print)	9781581137620
DOIs	https://doi.org/10.1109/ICCAD.2003.159672
Publication status	Published - Nov 2003
Event	2003 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2003 - DoubleTree Hotel, San Jose, United States Duration: 9 Nov 2003 → 13 Nov 2003 https://ieeexplore.ieee.org/xpl/conhome/8895/proceeding (Conference proceedings)

Publication series

Name	Proceedings of the IEEE/ACM international conference on Computer-aided design, ICCAD
Publisher	IEEE
ISSN (Print)	1092-3152

Conference

Conference	2003 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2003
Country/Territory	United States
City	San Jose
Period	9/11/03 → 13/11/03
Internet address	https://ieeexplore.ieee.org/xpl/conhome/8895/proceeding (Conference proceedings)

Access to Document

10.1109/ICCAD.2003.159672

Cite this

@inproceedings{76f089e0588b4f479ffcab4179adf9e2,

title = "Bus-Driven Floorplanning",

abstract = "In this paper, we present an integrated approach to floorplanning and bus planning, i.e., bus-driven floorplanning (BDF). We are given a set of circuit blocks and the bus specifications (i.e., the net list of blocks for the buses). A feasible BDF solution is a placement of all circuit blocks such that each bus can be realized as a rectangular strip (horizontal or vertical) going through all the blocks connected by the bus. The objective is to determine a feasible BDF solution that minimizes floorplan area and total bus area. Our approach is based upon the sequence-pair floorplan representation. After a careful analysis of the relationship between bus ordering and block ordering in the floorplan represented by a sequence pair, we derive feasibility conditions on sequence pairs that give feasible BDF solutions. Experimental results demonstrate the efficiency and effectiveness of our algorithm.",

author = "Hua Xiang and Xiaoping Tang and Wong, {Martin D. F.}",

note = "Funding information: This work was partially supported by the National Science Foundation under the grant CCR-0244236 and by a grant from the Cadence Design System Inc. Publisher copyright: {\textcopyright} 2003 ACM; 2003 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2003 ; Conference date: 09-11-2003 Through 13-11-2003",

year = "2003",

month = nov,

doi = "10.1109/ICCAD.2003.159672",

language = "English",

isbn = "9781581137620",

series = "Proceedings of the IEEE/ACM international conference on Computer-aided design, ICCAD",

publisher = "IEEE",

pages = "66--73",

booktitle = "Proceedings of The IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2003",

address = "United States",

url = "https://ieeexplore.ieee.org/xpl/conhome/8895/proceeding",

}

Xiang, H, Tang, X & Wong, MDF 2003, Bus-Driven Floorplanning. in Proceedings of The IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2003. Proceedings of the IEEE/ACM international conference on Computer-aided design, ICCAD, IEEE, United States, pp. 66-73, 2003 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2003, San Jose, California, United States, 9/11/03. https://doi.org/10.1109/ICCAD.2003.159672

Bus-Driven Floorplanning. / Xiang, Hua; Tang, Xiaoping; Wong, Martin D. F.
Proceedings of The IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2003. United States: IEEE, 2003. p. 66-73 (Proceedings of the IEEE/ACM international conference on Computer-aided design, ICCAD).

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

TY - GEN

T1 - Bus-Driven Floorplanning

AU - Xiang, Hua

AU - Tang, Xiaoping

AU - Wong, Martin D. F.

N1 - Funding information: This work was partially supported by the National Science Foundation under the grant CCR-0244236 and by a grant from the Cadence Design System Inc. Publisher copyright: © 2003 ACM

PY - 2003/11

Y1 - 2003/11

N2 - In this paper, we present an integrated approach to floorplanning and bus planning, i.e., bus-driven floorplanning (BDF). We are given a set of circuit blocks and the bus specifications (i.e., the net list of blocks for the buses). A feasible BDF solution is a placement of all circuit blocks such that each bus can be realized as a rectangular strip (horizontal or vertical) going through all the blocks connected by the bus. The objective is to determine a feasible BDF solution that minimizes floorplan area and total bus area. Our approach is based upon the sequence-pair floorplan representation. After a careful analysis of the relationship between bus ordering and block ordering in the floorplan represented by a sequence pair, we derive feasibility conditions on sequence pairs that give feasible BDF solutions. Experimental results demonstrate the efficiency and effectiveness of our algorithm.

AB - In this paper, we present an integrated approach to floorplanning and bus planning, i.e., bus-driven floorplanning (BDF). We are given a set of circuit blocks and the bus specifications (i.e., the net list of blocks for the buses). A feasible BDF solution is a placement of all circuit blocks such that each bus can be realized as a rectangular strip (horizontal or vertical) going through all the blocks connected by the bus. The objective is to determine a feasible BDF solution that minimizes floorplan area and total bus area. Our approach is based upon the sequence-pair floorplan representation. After a careful analysis of the relationship between bus ordering and block ordering in the floorplan represented by a sequence pair, we derive feasibility conditions on sequence pairs that give feasible BDF solutions. Experimental results demonstrate the efficiency and effectiveness of our algorithm.

UR - https://www.computer.org/csdl/proceedings-article/iccad/2003/01257588/12OmNrAdsyt

U2 - 10.1109/ICCAD.2003.159672

DO - 10.1109/ICCAD.2003.159672

M3 - Conference proceeding

SN - 9781581137620

T3 - Proceedings of the IEEE/ACM international conference on Computer-aided design, ICCAD

SP - 66

EP - 73

BT - Proceedings of The IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2003

PB - IEEE

CY - United States

T2 - 2003 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2003

Y2 - 9 November 2003 through 13 November 2003

ER -

Bus-Driven Floorplanning

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this