A comparison between MPI and OpenMP branch-and-bound skeletons

I. Dorta, C. León, C. Rodríguez
{"title":"A comparison between MPI and OpenMP branch-and-bound skeletons","authors":"I. Dorta, C. León, C. Rodríguez","doi":"10.1109/IPDPS.2003.1213254","DOIUrl":null,"url":null,"abstract":"This article describes and compares two parallel implementations of branch-and-bound skeletons. Using the C++ programming language, the user has to specify the type of the problem, the type of the solution and the specific characteristics of the branch-and-bound technique. This information is combined with the provided resolution skeletons to obtain a distributed and a shared parallel program. MPI has been used to develop the message passing algorithm and for the shared memory one OpenMP has been chosen. Computational results for the 0/1 knapsack problem on a Sunfire 6800 SMP, a Origin 3000 and a PCs cluster are presented.","PeriodicalId":177848,"journal":{"name":"Proceedings International Parallel and Distributed Processing Symposium","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings International Parallel and Distributed Processing Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPDPS.2003.1213254","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

This article describes and compares two parallel implementations of branch-and-bound skeletons. Using the C++ programming language, the user has to specify the type of the problem, the type of the solution and the specific characteristics of the branch-and-bound technique. This information is combined with the provided resolution skeletons to obtain a distributed and a shared parallel program. MPI has been used to develop the message passing algorithm and for the shared memory one OpenMP has been chosen. Computational results for the 0/1 knapsack problem on a Sunfire 6800 SMP, a Origin 3000 and a PCs cluster are presented.
MPI和OpenMP分支绑定骨架的比较
本文描述并比较了分支绑定框架的两个并行实现。使用c++编程语言,用户必须指定问题的类型、解决方案的类型以及分支定界技术的具体特征。将此信息与提供的解析框架结合起来,以获得分布式和共享的并行程序。使用MPI来开发消息传递算法,并选择OpenMP作为共享内存。给出了在Sunfire 6800 SMP、Origin 3000和PCs集群上0/1背包问题的计算结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信