An experimental evaluation of partitioning algorithms
- 9 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. P14-1/1
- https://doi.org/10.1109/asic.1991.242898
Abstract
Presents an experimental evaluation of partitioning algorithms to supplement the work done by D.S. Johnson, et al. (1989). MCNC test-cases are used as part of the test beds. A two-level partitioning algorithm is proposed whose performance exceeds that of the algorithm by C.M. Fiduccia, R.M. Mattheyses (1982) on real circuitry by as much as 28%.Keywords
This publication has 7 references indexed in Scilit:
- An improved objective function for mincut circuit partitioningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A general purpose multiple way partitioning algorithmPublished by Association for Computing Machinery (ACM) ,1991
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph PartitioningOperations Research, 1989
- An Improved Min-Cut Algonthm for Partitioning VLSI NetworksIEEE Transactions on Computers, 1984
- A Linear-Time Heuristic for Improving Network PartitionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970
- Module Clustering to Minimize Delay in Digital NetworksIEEE Transactions on Computers, 1969