A probabilistic multicommodity-flow solution to circuit clustering problems
- 1 January 1992
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Circuit clustering, which plays a fundamental role in hierarchical designs, is discussed. Identifying strongly connected components in the circuits can significantly reduce the complexity of the design and improve the performance of the design process. However, there has not been a clear objective function for circuit clustering. A clustering metric based on the random graph model and the ratio cust concept is presented. A probabilistic, multicommodity flow based algorithm is proposed and tested under the clustering metric. Experimental results show that this algorithm generates promising results with respect to the proposed metric. Extensions and directions for future work are also proposed.Keywords
This publication has 10 references indexed in Scilit:
- Finding clusters in VLSI circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A general purpose multiple way partitioning algorithmPublished by Association for Computing Machinery (ACM) ,1991
- The maximum concurrent flow problemJournal of the ACM, 1990
- Multiple-way network partitioningIEEE Transactions on Computers, 1989
- Linear Ordering and Application to PlacementPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- Clustering and linear placementPublished by Association for Computing Machinery (ACM) ,1972
- A Heuristic Procedure for the Partitioning and Mapping of Computer Logic GraphsIEEE Transactions on Computers, 1971
- On feasibility conditions of multicommodity flows in networksIEEE Transactions on Circuit Theory, 1971
- An r-Dimensional Quadratic Placement AlgorithmManagement Science, 1970
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970