Eric S. H. Wong
ABSTRACT
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.
- C. J. Alpert, J. H. Huang, and A. B. Kahng. Multilevel circuit partitioning. DAC, pages 530--533, 1997. Google Scholar
Digital Library
- J. Cong, Z. Li, and R. Bagrodia. Acyclic multi-way partitioning of boolean networks. Proceeding ACM/IEEE 31st Design Automation Conference, pages 670--675, June 1994. Google ScholarDigital Library
- C. M. Fiduccia and R. M. Mattheyses. A linear-time heuristic for improving network partitions. Design Automation Conference, pages 241--247, 1982. Google ScholarDigital Library
- G. Karypis and V. Kumar. Multilevel k-way hypergraph partitioning. ACM/IEEE Design Automation Conference, pages 343--348, 1999. Google ScholarDigital Library
- B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, pages 291--307, 1970.Google Scholar
- H. Liu and D. F. Wong. Network flow based circuit partitioning for time-multiplexed fpga. ICCAD, pages 497--504, 1998. Google ScholarDigital Library
- H. Yang and D. F. Wong. Efficient network flow based min-cut balanced partitioning. IEEE ICCAD, pages 50--55, November 1994. Google ScholarDigital Library
- H. Yang and D. F. Wong. New algorithms for min-cut replication in partitioned circuits. ICCAD, pages 216--222, 1995. Google ScholarDigital Library
- R. Boppana. Eigenvalues and Graph Bisection: An Average-Case Analysis. IEEE Symp. on Foundations of Computer Science, pages 280--285, 1987.Google Scholar
- P. K. Chan and D. F. Schlag and J. Zien. Spectral K-way Ratio-Cut Partitioning and Clustering. Proceeding ACM/IEEE Design Automation Conference, pages 749--754, 1993. Google ScholarDigital Library
Index Terms
- Clustering based acyclic multi-way partitioning
Recommendations
On the Impact of Post-clustering Phase in Multi-way Spectral Partitioning
MIKE 2015: Proceedings of the Third International Conference on Mining Intelligence and Knowledge Exploration - Volume 9468Spectral clustering is one of the most popular modern graph clustering techniques in machine learning. By using the eigenvalue analysis, spectral methods partition the given set of points into number of disjoint groups. Spectral methods are very useful ...
A new hybrid method based on partitioning-based DBSCAN and ant clustering
Clustering problem is an unsupervised learning problem. It is a procedure that partition data objects into matching clusters. The data objects in the same cluster are quite similar to each other and dissimilar in the other clusters. Density-based ...
Global clustering-based performance-driven circuit partitioning
ISPD '02: Proceedings of the 2002 international symposium on Physical designIn this paper, we propose a new global clustering based multi-level partitioning algorithm for performance optimization. Our algorithm computes a delay minimal K-way partition first, then gradually reduces the cutsize while keeping the circuit delay by ...
Comments