Abstract
In this paper we introduce a new parallel variant of simulated annealing for optimizing mesh partitions. We view this work as a first step towards a parallel multilevel algorithm for the load balancing problem. The serial execution time of the algorithm and the quality of the partitions it generates is compared to the well known METIS for three unstructured meshes. Finally, some preliminary experimental results regarding the performance of the proposed parallel variant of simulated annealing on a cluster of workstations are presented.
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.
