{"title":"合作竞争!点对点桌面网格上任务并行SAT求解的混合求解策略","authors":"S. Schulz, W. Blochinger","doi":"10.1109/HPCS.2010.5547121","DOIUrl":null,"url":null,"abstract":"The presented work is part of our long-term research goal to develop parallel SAT solving methods for large scale Peer-to-Peer Desktop Grids, which aggregate globally distributed resources. In such a parallel environment, appropriate strategies for dealing with massive parallelism are necessary. In particular, efficiency and at the same time robustness of the parallel methods must be ensured. In this paper, we report on a hybrid strategy for parallel SAT Solving, which combines exploratory and competition parallelism in an adaptive way to meet these goals.","PeriodicalId":227864,"journal":{"name":"International Symposium on High Performance Computing Systems and Applications","volume":"127 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Cooperate and compete! A hybrid solving strategy for task-parallel SAT solving on Peer-to-Peer Desktop Grids\",\"authors\":\"S. Schulz, W. Blochinger\",\"doi\":\"10.1109/HPCS.2010.5547121\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The presented work is part of our long-term research goal to develop parallel SAT solving methods for large scale Peer-to-Peer Desktop Grids, which aggregate globally distributed resources. In such a parallel environment, appropriate strategies for dealing with massive parallelism are necessary. In particular, efficiency and at the same time robustness of the parallel methods must be ensured. In this paper, we report on a hybrid strategy for parallel SAT Solving, which combines exploratory and competition parallelism in an adaptive way to meet these goals.\",\"PeriodicalId\":227864,\"journal\":{\"name\":\"International Symposium on High Performance Computing Systems and Applications\",\"volume\":\"127 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-08-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on High Performance Computing Systems and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPCS.2010.5547121\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on High Performance Computing Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPCS.2010.5547121","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Cooperate and compete! A hybrid solving strategy for task-parallel SAT solving on Peer-to-Peer Desktop Grids
The presented work is part of our long-term research goal to develop parallel SAT solving methods for large scale Peer-to-Peer Desktop Grids, which aggregate globally distributed resources. In such a parallel environment, appropriate strategies for dealing with massive parallelism are necessary. In particular, efficiency and at the same time robustness of the parallel methods must be ensured. In this paper, we report on a hybrid strategy for parallel SAT Solving, which combines exploratory and competition parallelism in an adaptive way to meet these goals.