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

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

    Research output: Contribution to journalArticle

    Abstract

    We define a variant of (Formula presented.)-of-(Formula presented.) testing that we call conservative(Formula presented.)-of-(Formula presented.) testing. We present a polynomial-time, combinatorial algorithm for the problem of maximizing throughput of conservative (Formula presented.)-of-(Formula presented.) 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 (Formula presented.) (or (Formula presented.)). We also give a polynomial-time algorithm for maximizing throughput for standard(Formula presented.)-of-(Formula presented.) testing, based on the ellipsoid method, using previous techniques.

    Original languageEnglish (US)
    JournalAlgorithmica (New York)
    DOIs
    StateAccepted/In press - Nov 9 2015

    Fingerprint

    Throughput
    Testing
    Polynomials
    Combinatorial Algorithms
    Ellipsoid Method
    Polynomial-time Algorithm
    Polynomial time
    Filter

    Keywords

    • k-of-n testing
    • Maximum throughput
    • Sequential testing

    ASJC Scopus subject areas

    • Computer Science(all)
    • Computer Science Applications
    • Applied Mathematics

    Cite this

    Max-Throughput for (Conservative) k-of-n Testing. / Hellerstein, Lisa; Özkan, Özgür; Sellie, Linda.

    In: Algorithmica (New York), 09.11.2015.

    Research output: Contribution to journalArticle

    Hellerstein, Lisa ; Özkan, Özgür ; Sellie, Linda. / Max-Throughput for (Conservative) k-of-n Testing. In: Algorithmica (New York). 2015.
    @article{1db87e36909d4c8cb41e2e10580df481,
    title = "Max-Throughput for (Conservative) k-of-n Testing",
    abstract = "We define a variant of (Formula presented.)-of-(Formula presented.) testing that we call conservative(Formula presented.)-of-(Formula presented.) testing. We present a polynomial-time, combinatorial algorithm for the problem of maximizing throughput of conservative (Formula presented.)-of-(Formula presented.) 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 (Formula presented.) (or (Formula presented.)). We also give a polynomial-time algorithm for maximizing throughput for standard(Formula presented.)-of-(Formula presented.) testing, based on the ellipsoid method, using previous techniques.",
    keywords = "k-of-n testing, Maximum throughput, Sequential testing",
    author = "Lisa Hellerstein and {\"O}zg{\"u}r {\"O}zkan and Linda Sellie",
    year = "2015",
    month = "11",
    day = "9",
    doi = "10.1007/s00453-015-0089-4",
    language = "English (US)",
    journal = "Algorithmica",
    issn = "0178-4617",
    publisher = "Springer New York",

    }

    TY - JOUR

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

    AU - Hellerstein, Lisa

    AU - Özkan, Özgür

    AU - Sellie, Linda

    PY - 2015/11/9

    Y1 - 2015/11/9

    N2 - We define a variant of (Formula presented.)-of-(Formula presented.) testing that we call conservative(Formula presented.)-of-(Formula presented.) testing. We present a polynomial-time, combinatorial algorithm for the problem of maximizing throughput of conservative (Formula presented.)-of-(Formula presented.) 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 (Formula presented.) (or (Formula presented.)). We also give a polynomial-time algorithm for maximizing throughput for standard(Formula presented.)-of-(Formula presented.) testing, based on the ellipsoid method, using previous techniques.

    AB - We define a variant of (Formula presented.)-of-(Formula presented.) testing that we call conservative(Formula presented.)-of-(Formula presented.) testing. We present a polynomial-time, combinatorial algorithm for the problem of maximizing throughput of conservative (Formula presented.)-of-(Formula presented.) 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 (Formula presented.) (or (Formula presented.)). We also give a polynomial-time algorithm for maximizing throughput for standard(Formula presented.)-of-(Formula presented.) testing, based on the ellipsoid method, using previous techniques.

    KW - k-of-n testing

    KW - Maximum throughput

    KW - Sequential testing

    UR - http://www.scopus.com/inward/record.url?scp=84946763331&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84946763331&partnerID=8YFLogxK

    U2 - 10.1007/s00453-015-0089-4

    DO - 10.1007/s00453-015-0089-4

    M3 - Article

    JO - Algorithmica

    JF - Algorithmica

    SN - 0178-4617

    ER -