Abstract
As useful software tools for GPU (Graphics Processing Unit) have been provided, GPGPU (General Purpose computing on GPU) becomes popular recently. However, the usage of GPU in the field of CAD algorithm for VLSI has not been large yet. The reason of this is that algorithms in this field have a tendency such that they must change operations of the next step according to the result of the current step. Hence, introduction of parallelism is not easy. In this paper, we consider rectangle packing problem which is important to VLSI floorplan, and propose an algorithm which can employ GPU effectively. The algorithm is obtained by improving defects of temperature parallel simulated annealing algorithm. Experimental results for benchmark data show its effectiveness.
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.
