Youssef Saab
- 1.C. Alpert. The ISPD98 circuit benchmarks suite. Physical Design Workshop, pages 80-85, 1998. Google Scholar
Digital Library
- 2.C. J. Alpert, J.-H. Huang, and A. B. Kahng. Multilevel circuit partitioning. Design Automation Conference, pages 530-533, 1997. Google ScholarDigital Library
- 3.J. Cong, H. P. LI, S. K. Lim, T. Shibuya, and D. Xu. large scale circuit partitioning with loose/stable net removal and signal flow based clustering. International Conference on Computer-Aided Design, pages 441-446, 1997. Google ScholarDigital Library
- 4.S. Dutt and W. Deng. VLSI circuit partitioning by cluster-removal using iterative improvement techniques. International Conference on Computer-Aided Design, pages 194-200, 1996. Google ScholarDigital Library
- 5.C. Fiduccia and R. Mattheyses. A linear-time heuristics for improving network partitions. Proceedings of the 19th Design Automation Conference, pages 175- 181, January 1982. Google ScholarDigital Library
- 6.L. W. Hagen, D. J. H. Huang, and A. B. Kahng. On implementation choices for iterative improvement partitioning algorithms. IEEE Transactions on Computer- Aided Design, 16(10):1199-1205, 1997. Google ScholarDigital Library
- 7.G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar. Multilevel hypergraph partitioning: Application in VLSI domain. Design Automation Conference, pages 526-529, 1997. Google ScholarDigital Library
- 8.Y. Saab. A fast and robust network bisection algorithm. IEEE Transactions on Computers, 44(7):903-913, July 1995. Google ScholarDigital Library
Recommendations
Multithreaded Clustering for Multi-level Hypergraph Partitioning
IPDPS '12: Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing SymposiumRequirements for efficient parallelization of many complex and irregular applications can be cast as a hyper graph partitioning problem. The current-state-of-the art software libraries that provide tool support for the hyper graph partitioning problem ...
An efficient multi-way algorithm for balanced partitioning of VLSI circuits
ICCD '97: Proceedings of the 1997 International Conference on Computer Design (ICCD '97)This paper presents an efficient algorithm for multi-way balanced partitioning of VLSI circuits. The proposed algorithm is still based on the widely used net-cut model, but its novelty is the potential gain function into the net-cut cost function to ...
An Efficient Multi-Level Partitioning Algorithm for VLSI Circuits
VLSID '03: Proceedings of the 16th International Conference on VLSI DesignIn this paper, a new multi-level bipartitioningalgorithm MLP, which integrates a clustering techniqueand an iterative improvement based partitioning process,is proposed to enhance the stability and the quality ofpartitioning results. The proposed ...
Comments