Exploring adjacency in floorplanning

Jia Wang; Hai Zhou

doi:10.1109/ASPDAC.2009.4796508

Exploring adjacency in floorplanning

Jia Wang^*, Hai Zhou

^*Corresponding author for this work

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

4 Scopus citations

Abstract

This paper describes a new floorplanning approach called Constrained Adjacency Graph (CAG) that helps exploring adjacency in floorplans. CAG extends the previous adjacency graph approaches by adding explicit adjacency constraints to the graph edges. After sufficient and necessary conditions of CAG are developed based on dissected floorplans, CAG is extended to handle general floorplans in order to improve area without changing the adjacency relations dramatically. These characteristics are currently utilized in a randomized greedy improvement heuristic for wire length optimization. The results show that better floorplans are found with much less running time for problems with 100 to 300 modules in comparison to a simulated annealing floorplanner based on sequence pairs.

Original language	English (US)
Title of host publication	Proceedings of the ASP-DAC 2009
Subtitle of host publication	Asia and South Pacific Design Automation Conference 2009
Pages	367-372
Number of pages	6
DOIs	https://doi.org/10.1109/ASPDAC.2009.4796508
State	Published - 2009
Event	Asia and South Pacific Design Automation Conference 2009, ASP-DAC 2009 - Yokohama, Japan Duration: Jan 19 2009 → Jan 22 2009

Publication series

Name	Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Other

Other	Asia and South Pacific Design Automation Conference 2009, ASP-DAC 2009
Country/Territory	Japan
City	Yokohama
Period	1/19/09 → 1/22/09

ASJC Scopus subject areas

Computer Science Applications
Computer Graphics and Computer-Aided Design
Electrical and Electronic Engineering

Access to Document

10.1109/ASPDAC.2009.4796508

Cite this

@inproceedings{336bc0bb9b9540b4903a1a39afaab320,

title = "Exploring adjacency in floorplanning",

abstract = "This paper describes a new floorplanning approach called Constrained Adjacency Graph (CAG) that helps exploring adjacency in floorplans. CAG extends the previous adjacency graph approaches by adding explicit adjacency constraints to the graph edges. After sufficient and necessary conditions of CAG are developed based on dissected floorplans, CAG is extended to handle general floorplans in order to improve area without changing the adjacency relations dramatically. These characteristics are currently utilized in a randomized greedy improvement heuristic for wire length optimization. The results show that better floorplans are found with much less running time for problems with 100 to 300 modules in comparison to a simulated annealing floorplanner based on sequence pairs.",

author = "Jia Wang and Hai Zhou",

year = "2009",

doi = "10.1109/ASPDAC.2009.4796508",

language = "English (US)",

isbn = "9781424427482",

series = "Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC",

pages = "367--372",

booktitle = "Proceedings of the ASP-DAC 2009",

note = "Asia and South Pacific Design Automation Conference 2009, ASP-DAC 2009 ; Conference date: 19-01-2009 Through 22-01-2009",

}

Wang, J & Zhou, H 2009, Exploring adjacency in floorplanning. in Proceedings of the ASP-DAC 2009: Asia and South Pacific Design Automation Conference 2009., 4796508, Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC, pp. 367-372, Asia and South Pacific Design Automation Conference 2009, ASP-DAC 2009, Yokohama, Japan, 1/19/09. https://doi.org/10.1109/ASPDAC.2009.4796508

TY - GEN

T1 - Exploring adjacency in floorplanning

AU - Wang, Jia

AU - Zhou, Hai

PY - 2009

Y1 - 2009

N2 - This paper describes a new floorplanning approach called Constrained Adjacency Graph (CAG) that helps exploring adjacency in floorplans. CAG extends the previous adjacency graph approaches by adding explicit adjacency constraints to the graph edges. After sufficient and necessary conditions of CAG are developed based on dissected floorplans, CAG is extended to handle general floorplans in order to improve area without changing the adjacency relations dramatically. These characteristics are currently utilized in a randomized greedy improvement heuristic for wire length optimization. The results show that better floorplans are found with much less running time for problems with 100 to 300 modules in comparison to a simulated annealing floorplanner based on sequence pairs.

AB - This paper describes a new floorplanning approach called Constrained Adjacency Graph (CAG) that helps exploring adjacency in floorplans. CAG extends the previous adjacency graph approaches by adding explicit adjacency constraints to the graph edges. After sufficient and necessary conditions of CAG are developed based on dissected floorplans, CAG is extended to handle general floorplans in order to improve area without changing the adjacency relations dramatically. These characteristics are currently utilized in a randomized greedy improvement heuristic for wire length optimization. The results show that better floorplans are found with much less running time for problems with 100 to 300 modules in comparison to a simulated annealing floorplanner based on sequence pairs.

UR - http://www.scopus.com/inward/record.url?scp=64549121949&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=64549121949&partnerID=8YFLogxK

U2 - 10.1109/ASPDAC.2009.4796508

DO - 10.1109/ASPDAC.2009.4796508

M3 - Conference contribution

AN - SCOPUS:64549121949

SN - 9781424427482

T3 - Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

SP - 367

EP - 372

BT - Proceedings of the ASP-DAC 2009

T2 - Asia and South Pacific Design Automation Conference 2009, ASP-DAC 2009

Y2 - 19 January 2009 through 22 January 2009

ER -

Exploring adjacency in floorplanning

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this