arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2403.08790cs.DCcs.AI
收藏

利用序列运行时分布进行SAT局部搜索的并行加速预测

Using Sequential Runtime Distributions for the Parallel Speedup Prediction of SAT Local Search

University of Tokyo(东京大学);CNRS(法国国家科学研究中心);UPMC(巴黎第六大学(皮埃尔和玛丽·居里大学));University of Nantes(南特大学)

Alejandro Arbelaez, Charlotte Truchet, Philippe Codognet

AI总结:

本研究提出一种基于序列运行时分布与次序统计量的框架,预测SAT局部搜索算法的并行加速性能,经两款求解器在384核硬件上的实验验证准确率较高,并发现其运行时分布可由指数或对数正态分布近似。

摘要:

本文对可满足性问题(SAT)局部搜索算法的可扩展性与并行化展开了详细分析。我们提出一种框架,通过分析给定算法序列版本的运行时行为,估算其并行性能。具体而言,借助统计方法近似序列过程的运行时分布,便可通过基于次序统计量的模型预测并行过程的运行时行为。我们将该方法应用于Sparrow和CCASAT这两款SAT局部搜索求解器的并行性能研究,并将预测性能与在最高384核的并行硬件上开展的实际实验结果进行对比。结果表明,该模型准确率较高,预测性能与实证数据接近。此外,在研究不同类型的实例(随机实例与构造实例)时,我们观察到这些局部搜索求解器表现出不同的行为,其运行时分布可由两类分布近似:指数分布(带偏移与不带偏移)和对数正态分布。

英文摘要:

This paper presents a detailed analysis of the scalability and parallelization of local search algorithms for the Satisfiability problem. We propose a framework to estimate the parallel performance of a given algorithm by analyzing the runtime behavior of its sequential version. Indeed, by approximating the runtime distribution of the sequential process with statistical methods, the runtime behavior of the parallel process can be predicted by a model based on order statistics. We apply this approach to study the parallel performance of two SAT local search solvers, namely Sparrow and CCASAT, and compare the predicted performances to the results of an actual experimentation on parallel hardware up to 384 cores. We show that the model is accurate and predicts performance close to the empirical data. Moreover, as we study different types of instances (random and crafted), we observe that the local search solvers exhibit different behaviors and that their runtime distributions can be approximated by two types of distributions: exponential (shifted and non-shifted) and lognormal.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑