arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1109.3401cs.DScs.DC
收藏

(保守)k-of-n检验的最大吞吐量

Max-Throughput for (Conservative) k-of-n Testing

Lisa Hellerstein, Özgür Özkan, Linda Sellie

摘要:

我们定义了一个变种的k-of-n测试,我们称之为保守k-of-n测试。我们提出了一个多项式时间,组合算法的问题,最大限度地提高吞吐量的保守的k-n测试,在一个并行设置。这扩展了Kodialam和Condon等人以前的工作,他提出了并行流水线滤波器排序的组合算法,这是k=1(或k = n)的特殊情况。我们还考虑了标准的k-of-n测试的吞吐量最大化的问题,并展示了如何获得一个多项式时间算法的基础上使用以前的技术的椭球方法。

英文摘要:

We define a variant of k-of-n testing that we call conservative k-of-n testing. We present a polynomial-time, combinatorial algorithm for the problem of maximizing throughput of conservative k-of-n testing, in a parallel setting. This extends previous work of Kodialam and Condon et al., who presented combinatorial algorithms for parallel pipelined filter ordering, which is the special case where k=1 (or k = n). We also consider the problem of maximizing throughput for standard k-of-n testing, and show how to obtain a polynomial-time algorithm based on the ellipsoid method using previous techniques.

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

↑