{"title":"MPI和OpenMP分支绑定骨架的比较","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":"{\"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}","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}
A comparison between MPI and OpenMP branch-and-bound skeletons
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.