Max-Throughput for (Conservative) k-of-n Testing
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 maximizing the throughput of conservative k-of-n testing, in a parallel setting. This extends previous work of Kodialam and Condon et al. on the parallel pipelined filter ordering problem, which is the special case where k = 1 (or k = n) [1,2,3]. We also consider the problem of maximizing throughput for standard k-of-n testing, and describe a polynomial-time algorithm for it based on the ellipsoid method.
KeywordsTesting Strategy Precedence Constraint Rate Limit Combinatorial Algorithm Conservative Variant
Unable to display preview. Download preview PDF.
- 2.Condon, A., Deshpande, A., Hellerstein, L., Wu, N.: Flow algorithms for two pipelined filter ordering problems. In: PODS, ACM, pp. 193–202 (2006)Google Scholar
- 3.Condon, A., Deshpande, A., Hellerstein, L., Wu, N.: Algorithms for distributional and adversarial pipelined filter ordering problems. ACM Transactions on Algorithms 5 (2009)Google Scholar
- 4.Liu, Z., Parthasarathy, S., Ranganathan, A., Yang, H.: A generic flow algorithm for shared filter ordering problems. In: Lenzerini, M., Lembo, D. (eds.) PODS, ACM, pp. 79–88 (2008)Google Scholar
- 5.Deshpande, A., Hellerstein, L.: Parallel pipelined filter ordering with precedence constraints. Pre-publication version (To appear in ACM Transactions on Algorithms), http://cis.poly.edu/string~hstein/pubs/filterwithconstraint.pdf
- 6.Salloum, S.: Optimal testing algorithms for symmetric coherent systems. PhD thesis, Univ. of Southern California (1979)Google Scholar
- 10.Hellerstein, L., Özkan, Ö., Sellie, L.: Max-throughput for (conservative) k-of-n testing. CoRR abs/1109.3401 (2011)Google Scholar