Skip to main content
SpringerLink
Log in

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

  • Published:
Algorithmica Aims and scope Submit manuscript

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 the problem of maximizing throughput of conservative \(k\)-of-\(n\) testing, in a parallel setting. This extends previous work of Condon et al. and Kodialam who presented combinatorial algorithms for parallel pipelined filter ordering, which is the special case where \(k=1\) (or \(k=n\)). We also give a polynomial-time algorithm for maximizing throughput for standard \(k\)-of-\(n\) testing, based on the ellipsoid method, using previous techniques.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Notes

  1. An alternative definition of \(k\)-of-\(n\) testing requires that we determine whether at least \(k\) of the tests have value 1. Symmetric results hold for this definition.

References

  1. Ben-Dov, Y.: Optimal testing procedure for special structures of coherent systems. Manag. Sci. 27, 1410–1420 (1981)

    Article  MATH  Google Scholar 

  2. Boros, E., Ünlüyurt, T.: Diagnosing double regular systems. Ann. Math. Artif. Intell. 26(1–4), 171–191 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chang, M.-F., Shi, W., Fuchs, W.K.: Optimal diagnosis procedures for k-out-of-n structures. IEEE Trans. Comput. 39(4), 559–564 (1990)

    Article  Google Scholar 

  4. Condon, A., Deshpande, A., Hellerstein, L., Wu, N.: Flow algorithms for two pipelined filter ordering problems. In: Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 193–202. ACM (2006)

  5. Condon, A., Deshpande, A., Hellerstein, L., Ning, W.: Algorithms for distributional and adversarial pipelined filter ordering problems. ACM Trans. Algorithms 5, 24:1–24:34 (2009)

    Article  MathSciNet  Google Scholar 

  6. Cox, L., Qiu, Y., Kuehner, W.: Heuristic least-cost computation of discrete classification functions with uncertain argument values. Ann. Oper. Res. 21, 1–29 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  7. Deshpande, A., Hellerstein, L.: Parallel pipelined filter ordering with precedence constraints. ACM Trans. Algorithms 8(4), 41 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  8. Deshpande, A., Hellerstein, L., Kletenik, D.: Approximation algorithms for stochastic boolean function evaluation and stochastic submodular set cover. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1453–1466 (2014)

  9. Garey, M.R.: Optimal task sequencing with precedence constraints. Discrete Math. 4, 37–56 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kaplan, H., Kushilevitz, E., Mansour, Y.: Learning with attribute costs. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 356–365 (2005)

  11. Kodialam, M.S.: The throughput of sequential testing. In: Proceedings of the 8th International Conference on Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 2081, pp. 280–292. Springer (2001)

  12. Liu, Z., Parthasarathy, S., Ranganathan, A., Yang, H.: A generic flow algorithm for shared filter ordering problems. In: Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 79–88. ACM (2008)

  13. Salloum, S.: Optimal testing algorithms for symmetric coherent systems. Ph.D. thesis, University of Southern California (1979)

  14. Salloum, S., Breuer, M.A.: An optimum testing algorithm for some symmetric coherent systems. J. Math. Anal. Appl. 101(1), 170–194 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  15. Salloum, S., Breuer, M.A.: Fast optimal diagnosis procedures for k-out-of-n: G systems. IEEE Trans. Reliab. 46(2), 283–290 (1997)

    Article  Google Scholar 

  16. Sarnak, N., Tarjan, R.E.: Planar point location using persistent search trees. Commun. ACM 29(7), 669–679 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  17. Ünlüyurt, T.: Sequential testing of complex systems: a review. Discrete Appl. Math. 142(1–3), 189–205 (2004)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. NYU School of Engineering, Brooklyn, NY, USA

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

Authors
  1. Lisa Hellerstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Özgür Özkan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Linda Sellie
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Özgür Özkan.

Additional information

Lisa Hellerstein was supported by NSF Grant CCF-0917153. Özgür Özkan was supported by US Department of Education Grant P200A090157. Linda Sellie was supported by a CIFellows Project postdoc, sponsored by NSF and the CRA.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hellerstein, L., Özkan, Ö. & Sellie, L. Max-Throughput for (Conservative) k-of-n Testing. Algorithmica 77, 595–618 (2017). https://doi.org/10.1007/s00453-015-0089-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-015-0089-4

Keywords

Mathematics Subject Classification

Search

Navigation