ParaPART: Parallel Mesh Partitioning Tool for Distributed Systems

Jing Chen, V. Taylor
{"title":"ParaPART: Parallel Mesh Partitioning Tool for Distributed Systems","authors":"Jing Chen, V. Taylor","doi":"10.1002/(SICI)1096-9128(200002/03)12:2/3%3C111::AID-CPE470%3E3.0.CO;2-J","DOIUrl":null,"url":null,"abstract":"In this paper, we present ParaPART, a parallel version of a mesh partitioning tool, called PART, for distributed systems. PART takes into consideration the heterogeneities in processor performance, network performance and application computational complexities to achieve a balanced estimate of execution time across the processors in the distributed system. Simulated annealing is used in PART to perform the backtracking search for desired partitions. ParaPART significantly improves performance of PART by using the asynchronous multiple Markov chain approach of parallel simulated annealing. ParaPART is used to partition six irregular meshes into 8, 16, and 100 subdomains using up to 64 client processors on an IBM SP2 machine. The results show superlinear speedup in most cases and nearly perfect speedup for the rest. Using the partitions from ParaPART, we ran an explicit, 2-D finite element code on two geographically distributed IBM SP machines. Results indicate that ParaPART produces results consistent with PART. The execution time was reduced by 12% as compared with partitions that consider only processor performance; this is significant given the theoretical upper bound of 15% reduction.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"89 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurr. Pract. Exp.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/(SICI)1096-9128(200002/03)12:2/3%3C111::AID-CPE470%3E3.0.CO;2-J","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 22

Abstract

In this paper, we present ParaPART, a parallel version of a mesh partitioning tool, called PART, for distributed systems. PART takes into consideration the heterogeneities in processor performance, network performance and application computational complexities to achieve a balanced estimate of execution time across the processors in the distributed system. Simulated annealing is used in PART to perform the backtracking search for desired partitions. ParaPART significantly improves performance of PART by using the asynchronous multiple Markov chain approach of parallel simulated annealing. ParaPART is used to partition six irregular meshes into 8, 16, and 100 subdomains using up to 64 client processors on an IBM SP2 machine. The results show superlinear speedup in most cases and nearly perfect speedup for the rest. Using the partitions from ParaPART, we ran an explicit, 2-D finite element code on two geographically distributed IBM SP machines. Results indicate that ParaPART produces results consistent with PART. The execution time was reduced by 12% as compared with partitions that consider only processor performance; this is significant given the theoretical upper bound of 15% reduction.
ParaPART:分布式系统的并行网格划分工具
在本文中,我们提出了ParaPART,一个网格划分工具的并行版本,称为PART,用于分布式系统。PART考虑了处理器性能、网络性能和应用程序计算复杂性的异构性,以实现对分布式系统中处理器间执行时间的平衡估计。在PART中使用模拟退火对期望分区进行回溯搜索。ParaPART采用并行模拟退火的异步多重马尔可夫链方法,显著提高了PART的性能。ParaPART用于在IBM SP2机器上使用多达64个客户机处理器将6个不规则网格划分为8、16和100个子域。结果显示,在大多数情况下,加速是超线性的,而在其他情况下,加速几乎是完美的。使用来自ParaPART的分区,我们在两台地理上分布的IBM SP机器上运行了一个显式的二维有限元代码。结果表明,ParaPART产生的结果与PART一致。与只考虑处理器性能的分区相比,执行时间减少了12%;考虑到理论上减少15%的上限,这是很重要的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信