An Experimental Study of an Ant-colony Algorithm for the Mesh-partitioning Problem

Abstract

Parallel computer systems are suitable for solving computationally intensive numerical methods such as finite-volume and finite-element methods for solving partial di.erential equations. A program and associated data are distributed among the processors. The aim is to find a distribution where the communication is as low as possible. This leads to the mesh-partitioning optimization problem, which is known to be an NP-hard. Ant-colony algorithm (ACA) is a relatively new metaheuristic search technique for solving general optimization problems. We experimentally study ACA for solving the mesh-partitioning problem.

Section
Special Issue
{"ft_lang_label":"__label__en","ft_lang_prob":0.87414646,"math_prob":0.7630174,"size":821,"snap":"2019-26-2019-30","text_gpt3_token_len":152,"char_repetition_ratio":0.11383109,"word_repetition_ratio":0.0,"special_character_ratio":0.16686967,"punctuation_ratio":0.11851852,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.95138186,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-06-25T09:53:13Z\",\"WARC-Record-ID\":\"<urn:uuid:a6d5bebf-b867-4661-abf9-0a8569d13aaf>\",\"Content-Length\":\"13716\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:8e0eeca0-8dce-4365-ad63-d12fc9d5c3fe>\",\"WARC-Concurrent-To\":\"<urn:uuid:a0c49e51-7f07-4031-9119-c53e8b590564>\",\"WARC-IP-Address\":\"173.249.57.26\",\"WARC-Target-URI\":\"https://www.scpe.org/index.php/scpe/article/view/292\",\"WARC-Payload-Digest\":\"sha1:OXXUFBGQMBGSOE4KGW27TU3J73BNV4FE\",\"WARC-Block-Digest\":\"sha1:R2O4HX5RXS5AFW7VVDB4ATWSNJ6SVQPN\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-26/CC-MAIN-2019-26_segments_1560627999817.30_warc_CC-MAIN-20190625092324-20190625114324-00484.warc.gz\"}"}