分布式程序符号合成中死锁消解的简化
Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs
摘要:
以前的工作已经表明,有两个主要的复杂性障碍,在容错分布式程序的合成:(1)故障跨度的生成,在故障的存在下可达到的状态集,和(2)解决死锁状态,从那里程序没有传出的转换。其中,前者与模型检验非常相似,因此,有效的验证技术直接适用于它。我们提出了两种并行化的方法,考虑不同的设计选择。第一种方法是基于由于分布问题而需要的程序转换的等价类的计算(称为组计算)(即,进程无法原子地读取和写入所有程序变量)。我们表明,在大多数情况下,这种方法的加速比接近理想的加速比,在某些情况下,它是超线性的。第二种方法使用在多个线程之间划分死锁状态的传统技术。然而,我们的实验表明,这种方法的加速比是小的。因此,我们的分析表明,一个简单的方法,并行组计算可能是有效的方法,使用多核计算的背景下,死锁解决。
英文摘要:
Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs: (1) generation of fault-span, the set of states reachable in the presence of faults, and (2) resolving deadlock states, from where the program has no outgoing transitions. Of these, the former closely resembles with model checking and, hence, techniques for efficient verification are directly applicable to it. Hence, we focus on expediting the latter with the use of multi-core technology. We present two approaches for parallelization by considering different design choices. The first approach is based on the computation of equivalence classes of program transitions (called group computation) that are needed due to the issue of distribution (i.e., inability of processes to atomically read and write all program variables). We show that in most cases the speedup of this approach is close to the ideal speedup and in some cases it is superlinear. The second approach uses traditional technique of partitioning deadlock states among multiple threads. However, our experiments show that the speedup for this approach is small. Consequently, our analysis demonstrates that a simple approach of parallelizing the group computation is likely to be the effective method for using multi-core computing in the context of deadlock resolution.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。