| 基于任务分配与调度的GSAT算法求解3-SAT问题 |
| |
| 引用本文： | 付慧敏,徐扬,何星星,宁欣然. 基于任务分配与调度的GSAT算法求解3-SAT问题[J]. 计算机工程与科学, 2018, 40(8): 1366-1374 |
| |
| 作者姓名： | 付慧敏 徐扬 何星星 宁欣然 |
| |
| 作者单位： | (1.西南交通大学信息科学与技术学院，四川 成都 610031；2.西南交通大学系统可信性自动验证国家地方联合工程实验室,四川 成都 610031) |
| |
| 基金项目： | 国家自然科学基金(61673320);中央高校基本科研业务费项目(2682017ZT12,2682018ZT10,2682018CX59,2682018ZT25) |
| |
| 摘 要： | 基于不同分配策略的云计算任务调度以及任务分配与调度的主要目的，提出了一种新的算法—求解3-SAT问题的基于任务分配与调度的GSAT算法。该算法将3-SAT问题中的每一个变量形成一个任务，在GSAT算法的基础上，引入任务分配与调度指导贪心搜索；同时，在保留原有贪心搜索的前提下，根据任务分配与调度的思想和3-SAT问题的特点，设计了两种新的策略—分配策略和调度策略共同完成整个贪心搜索过程。以标准的SATLAB库中变量个数从 20～250的3 700个不同规模的标准Uniform Random 3-SAT 问题对新的算法的性能进行了合理的测试，并与高效和普通性能改进的GSAT算法的结果作了比较，结果表明，该算法具有更高的成功率和更少的翻转次数。
|
| 关 键 词： | GSAT算法 贪心搜索 任务分配与调度 3-SAT问题 分配策略 调度策略 |
| 收稿时间： | 2017-04-14 |
| 修稿时间： | 2018-08-25 |
GSAT algorithm based on task allocation andscheduling for solving the 3-SAT problem |
| |
| FU Hui min,XU Yang,HE Xing xing,NING Xin ran. GSAT algorithm based on task allocation andscheduling for solving the 3-SAT problem[J]. Computer Engineering & Science, 2018, 40(8): 1366-1374 |
| |
| Authors: | FU Hui min XU Yang HE Xing xing NING Xin ran |
| |
| Affiliation: | (1.School of Information Science and Technology,Southwest Jiaotong University,Chengdu 610031;2.National Local Joint Engineering Laboratory of System Credibility Automatic Verification,Southwest Jiaotong University,Chengdu 610031,China) |
| |
| Abstract: | Based on different allocation strategies for cloud computing task scheduling and task allocation and scheduling, a new algorithm—a GSAT algorithm based on task allocation and scheduling for solving the 3 SAT problem is proposed.The algorithm forms a task for each variable in the 3 SAT problem. Based on the GSAT algorithm,task allocation and scheduling is introduced to guide the greedy search. Meanwhile, under the premise of keeping the original greedy search, according to the idea of task allocation and scheduling and the characteristics of the 3 SAT problem, two new strategies (allocation strategy and scheduling strategy) are designed to complete the whole greedy search process together.In the experiments, 3700 standard Uniform Random 3 SAT problems with the variable number from 20 to 250 in SATLAB library were used to evaluate the performance of the new algorithm.Moreover, the new algorithm was compared with the improved GSAT algorithms with high performance and common performance.Experimental results show that the new algorithm has a higher success rate and fewer changes. |
| |
| Keywords: | GSAT algorithm greedy search task allocation and scheduling 3 SAT problem allocation strategy scheduling strategy |
|
| 点击此处可从《计算机工程与科学》浏览原始摘要信息 |
|
点击此处可从《计算机工程与科学》下载全文 |
