Abstract
M-way partitioning algorithms have many important applications in VLSI design. A heuristic Reduced Connectivity Matrix Partitioning (RCMP) algorithm can handle m-way partitioning with good time and space complexity. In this paper, we introduce a weighted RCMP (WRCMP) algorithm, which incorporates area constraints with performance objectives at the same time in order to extend the capability of RCMP. A program has been written and some experimental results are discussed. This modification would expand the application of the RCMP algorithm to area and performance constrained partitioning.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
