Clustering based acyclic multi-way partitioning

In this paper, we present a clustering based algorithm for acyclic multi-way partitioning. Many existing partitioning algorithms have shown that clustering can effectively improve the solution quality. However, most of them do not consider the signal direction and thus cannot maintain the acyclic property. Our algorithm is based on clustering by computing the modified fan-out free cones. Fan-out free cone clustering can reduce a graph to a smaller and sparser one, and maintain the acyclic property at the same time. Experimental results showed that our algorithm compares favorably with the previous best acyclic multi-way partitioning algorithm in cut-size. Categories and Subject Descriptors J.6 [Computer-Aided Engineering]: Computer-Aided Design (CAD) General Terms Design, Algorithm Keywords CAD, Partitioning, Clustering, Acyclic, Multi-way

• Type: Conference
• Year: 2003
• Where: GLVLSI
• Authors: Eric S. H. Wong, Evangeline F. Y. Young, Wai-Kei Mak
• Keywords: Acyclic Multi-way Partitioning, Acyclic Property, Algorithm, GLVLSI 2003, VLSI