Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kodialam, M.S.: The Throughput of Sequential Testing. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol. 2081, pp. 280–292. Springer, Heidelberg (2001)
Condon, A., Deshpande, A., Hellerstein, L., Wu, N.: Flow algorithms for two pipelined filter ordering problems. In: PODS, ACM, pp. 193–202 (2006)
Condon, A., Deshpande, A., Hellerstein, L., Wu, N.: Algorithms for distributional and adversarial pipelined filter ordering problems. ACM Transactions on Algorithms 5 (2009)
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)
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
Salloum, S.: Optimal testing algorithms for symmetric coherent systems. PhD thesis, Univ. of Southern California (1979)
Salloum, S., Breuer, M.A.: An optimum testing algorithm for some symmetric coherent systems. J. Mathematical Analysis and Applications 101, 170–194 (1984)
Ben-Dov, Y.: Optimal testing procedure for special structures of coherent systems. Management Science 27, 1410–1420 (1981)
Chang, M.F., Shi, W., Fuchs, W.K.: Optimal diagnosis procedures for k-out-of-n structures. IEEE Trans. Computers 39, 559–564 (1990)
Hellerstein, L., Özkan, Ö., Sellie, L.: Max-throughput for (conservative) k-of-n testing. CoRR abs/1109.3401 (2011)
Salloum, S., Breuer, M.: Fast optimal diagnosis procedures for k-out-of-n:g systems. IEEE Transactions on Reliability 46, 283–290 (1997)
Ünlüyurt, T.: Sequential testing of complex systems: a review. Discrete Applied Mathematics 142, 189–205 (2004); Boolean and Pseudo-Boolean Functions
Garey, M.R.: Optimal task sequencing with precedence constraints. Discrete Math. 4, 37–56 (1973)
Boros, E., Ünlüyurt, T.: Diagnosing double regular systems. Ann. Math. Artif. Intell. 26, 171–191 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hellerstein, L., Özkan, Ö., Sellie, L. (2011). Max-Throughput for (Conservative) k-of-n Testing. In: Asano, T., Nakano, Si., Okamoto, Y., Watanabe, O. (eds) Algorithms and Computation. ISAAC 2011. Lecture Notes in Computer Science, vol 7074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25591-5_72
Download citation
DOI: https://doi.org/10.1007/978-3-642-25591-5_72
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25590-8
Online ISBN: 978-3-642-25591-5
eBook Packages: Computer ScienceComputer Science (R0)