{"title":"Theoretical study on mixed parallel execution for solving SAT","authors":"Kairong Zhang , Masahiro Nagamatu","doi":"10.1016/j.ics.2006.12.021","DOIUrl":null,"url":null,"abstract":"<div><p>For the satisfiability problem (SAT), we have proposed a neural network, called LPPH, and a parallelization method, called “mixed parallel execution,” in which LPPH and other algorithms are executed simultaneously. In this paper we study the CPU time of the mixed parallel execution, and prove that the bigger the difference between distribution functions of CPU time of the algorithms used in the parallel execution, the more effective the mixed parallel execution is.</p></div>","PeriodicalId":84918,"journal":{"name":"International congress series","volume":"1301 ","pages":"Pages 176-179"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.ics.2006.12.021","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International congress series","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S053151310600673X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
For the satisfiability problem (SAT), we have proposed a neural network, called LPPH, and a parallelization method, called “mixed parallel execution,” in which LPPH and other algorithms are executed simultaneously. In this paper we study the CPU time of the mixed parallel execution, and prove that the bigger the difference between distribution functions of CPU time of the algorithms used in the parallel execution, the more effective the mixed parallel execution is.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
