A general framework for vertex orderings with applications to circuit clustering

Authors:
Charles J. Alpert;Andrew B. Kahng
Affiliations:
-;-
Venue:
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Year:
1996

Citing 0
Cited 6

Multilevel hypergraph partitioning: application in VLSI domain

DAC '97 Proceedings of the 34th annual Design Automation Conference
Generation of very large circuits to benchmark the partitioning of FPGA

ISPD '99 Proceedings of the 1999 international symposium on Physical design
Incremental physical design

ISPD '00 Proceedings of the 2000 international symposium on Physical design
Hierarchical Vertex Ordering

ICGT '02 Proceedings of the First International Conference on Graph Transformation
Efficient placement of geographical data over broadcast channel for spatial range query under quadratic cost model

Proceedings of the 3rd ACM international workshop on Data engineering for wireless and mobile access
Detecting tangled logic structures in VLSI netlists

Proceedings of the 47th Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Vertex orderings have been successfully applied to problems in netlist clustering and for system partitioning and layout. We present a vertex ordering construction that encompasses most reasonable graph traversals. Two parameters-an attraction function and a window-provide the means for achieving various graph traversals and addressing particular clustering requirements. We then use dynamic programming to optimality split the vertex ordering into a multiway clustering. Our approach outperforms several clustering methods in the literature in terms of three distinct clustering objectives. The ordering construction, by itself, also outperforms existing graph ordering constructions for this application. Tuning our approach to "meta-objectives", particularly clustering for two-phase Fiduccia-Mattheyses bipartitioning, remains an open area of research.