A Clustering Based Linear Ordering Algorithm for K-Way Spectral Partitioning

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Shiuann-Shiuh Lin Articles by Wen-Hsin Chen Articles by Wen-Wei Lin Articles by TingTing Hwang

Asia and South Pacific Design Automation Conference 1999 (ASP-DAC'99)

Wanchai, Hong Kong

January 18-January 21

ISBN: 0-7803-5012-X

	ASCII Text	x
	Shiuann-Shiuh Lin, Wen-Hsin Chen, Wen-Wei Lin, TingTing Hwang, "A Clustering Based Linear Ordering Algorithm for K-Way Spectral Partitioning," Asia and South Pacific Design Automation Conference, pp. 77, Asia and South Pacific Design Automation Conference 1999 (ASP-DAC'99), 1999.

	BibTex	x
	@article{ 10.1109/ASPDAC.1999.759714, author = {Shiuann-Shiuh Lin and Wen-Hsin Chen and Wen-Wei Lin and TingTing Hwang}, title = {A Clustering Based Linear Ordering Algorithm for K-Way Spectral Partitioning}, journal ={Asia and South Pacific Design Automation Conference}, volume = {0}, year = {1999}, isbn = {0-7803-5012-X}, pages = {77}, doi = {http://doi.ieeecomputersociety.org/10.1109/ASPDAC.1999.759714}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Asia and South Pacific Design Automation Conference TI - A Clustering Based Linear Ordering Algorithm for K-Way Spectral Partitioning SN - 0-7803-5012-X SP EP A1 - Shiuann-Shiuh Lin, A1 - Wen-Hsin Chen, A1 - Wen-Wei Lin, A1 - TingTing Hwang, PY - 1999 KW - null VL - 0 JA - Asia and South Pacific Design Automation Conference ER -

Shiuann-Shiuh Lin, National Tsing Hua University, HsinChu, Taiwan

Wen-Hsin Chen, National Tsing Hua University, HsinChu, Taiwan

Wen-Wei Lin, National Tsing Hua University, HsinChu, Taiwan

TingTing Hwang, National Tsing Hua University, HsinChu, Taiwan

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ASPDAC.1999.759714

The spectral method can lead to a high quality of multi-way partition due to its ability to capture global netlist information. For spectral partition, n netlist modules are mapped to n points in d-dimensional space, and then a linear ordering of these n modules is constructed to be used as a basis for partitioning. In this paper, we propose two clustering based linear ordering algorithms taking into consideration the objective function presented by [Spectral Partitioning: The More Eigenvectors, The Better].

Citation:

Shiuann-Shiuh Lin, Wen-Hsin Chen, Wen-Wei Lin, TingTing Hwang, "A Clustering Based Linear Ordering Algorithm for K-Way Spectral Partitioning," asp-dac, pp.77, Asia and South Pacific Design Automation Conference 1999 (ASP-DAC'99), 1999

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.